Search results for "covers"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
48	Bodo Manthey	On Approximating Restricted Cycle Covers.	WAOA	2005	DBLP DOI BibTeX RDF
46	Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko	On Partial Covers, Reducts and Decision Rules.	Trans. Rough Sets	2008	DBLP DOI BibTeX RDF	partial decision rules, Rough sets, greedy algorithms, partial covers, partial reducts
46	Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko	On Partial Covers, Reducts and Decision Rules with Weights.	Trans. Rough Sets	2007	DBLP DOI BibTeX RDF	partial decision rules, greedy algorithms, weights, partial covers, partial reducts
46	Sandeep Gupta 0004, Jinfeng Ni, Chinya V. Ravishankar	Efficient data dissemination using locale covers.	CIKM	2005	DBLP DOI BibTeX RDF	locale covers, latency, accuracy, dissemination, location-dependant data
46	Andrei Borshchev, Yuri G. Karpov, Victor Roudakov	Systems modeling, simulation and analysis using COVERS active objects.	ECBS	1997	DBLP DOI BibTeX RDF	COVERS active objects, object-oriented principles, reactive system design, object structure diagrams, object interconnection diagrams, data functions, modeling-simulation-analysis cycle, Windows-based graphical environment, visualization, object-oriented programming, C++, code generation, systems analysis, statecharts, systems modeling, semantic model, modeling language, simulation environment, systems simulation, model execution, data objects, behavior description, timed transition systems
41	Baruch Awerbuch, David Peleg	Sparse Partitions (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	sparse partitions, polynomial routing, online tracking, locality-preserving representations, graph-theoretic structures, tree covers, diameter-based separators, protocols, clustering algorithms, covers, regional matchings, network applications, decomposition techniques, arbitrary networks, sparse spanners
40	Valeria Efimova, Viacheslav Shalamov, Andrey Filchenkov	First Describe, Then Depict: Generating Covers for Music and Books via Extracting Keywords: This paper presents two methods to generate high resolution uncopyrighted book covers or music album covers.	AIPR	2022	DBLP DOI BibTeX RDF
40	Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko	Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.	J. ACM	2005	DBLP DOI BibTeX RDF	Approximation algorithms
40	Alexandre H. L. Porto, Valmir Carneiro Barbosa	Multiple Sequence Alignment Based on Set Covers.	EvoWorkshops	2006	DBLP DOI BibTeX RDF	Set covers, Multiple sequence alignment
40	Markus Bläser, Bodo Manthey	Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One.	Algorithmica	2005	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers
36	Jirí Fiala 0001, Daniël Paulusma	Comparing Universal Covers in Polynomial Time.	CSR	2008	DBLP DOI BibTeX RDF
36	Bodo Manthey	Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions.	WG	2006	DBLP DOI BibTeX RDF
36	Hartmut Klauck	Rectangle Size Bounds and Threshold Covers in Communication Complexity.	CCC	2003	DBLP DOI BibTeX RDF
36	Andrei Borshchev, Yuri G. Karpov, Victor Roudakov	COVERS 3.0 - An Object-Oriented Environment for Modeling, Simulation and Analysis of Real-Time Concurrent Systems.	DIS-RT	1997	DBLP DOI BibTeX RDF
36	V. S. Lakshmanan 0001	Split-Freedom and MVD-Intersection: A New Characterization of Multivalued Dependencies Having Conflict-Free Covers.	ICDT	1986	DBLP DOI BibTeX RDF
34	Antonia Bertolino, Martina Marré	Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers
34	Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg	Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers	FOCS	1993	DBLP DOI BibTeX RDF	near-linear cost sequential constructions, distributed constructions, sparse neighborhood covers, dynamic approximate shortest paths, distance-preserving graph spanners, network synchronizer constructions, adaptive routing, sequential algorithms, breadth-first-search, network decompositions
34	Charles E. Leiserson, Satish Rao, Sivan Toledo	Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	elliptic solver, blocking covers, sparse linear relaxation problems, primary memory, multigrid algorithm, iteration, out-of-core algorithms, numerical computation, linear relaxation
34	Ying Cheng 0006, S. Sitharama Iyengar, Rangasami L. Kashyap	A New Method of Image Compression using Irreducible Covers of Maximum Rectangles.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	irreducible covers, maximal rectangles, concurrent-read-exclusive write, parallel algorithm, parallel algorithms, data structures, data compression, computerised picture processing, image compression, pixels
32	Chih-Chung Lai, Chuan-Kang Ting, Ren-Song Ko	An effective genetic algorithm for improving wireless sensor network lifetime.	GECCO	2007	DBLP DOI BibTeX RDF	disjoint set covers, genetic algorithms, wireless sensor network
32	Mihaela Cardei, Ding-Zhu Du	Improving Wireless Sensor Network Lifetime through Power Aware Organization.	Wirel. Networks	2005	DBLP DOI BibTeX RDF	node organization, disjoint set covers, wireless sensor networks, energy efficiency
31	Jan De Beule, Patrick Govaerts, Anja Hallez, Leo Storme	Tight sets, weighted m -covers, weighted m -ovoids, and minihypers.	Des. Codes Cryptogr.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 05B25, 51E20, 51E12, 51E22
31	Changying Wang, Jie Zhang 0019, Yi Ma	Coastal Land Covers Classification of High-Resolution Images Based on Dempster-Shafer Evidence Theory.	CSSE (1)	2008	DBLP DOI BibTeX RDF
31	Jirí Fiala 0001, Jan Kratochvíl	Complexity of Partial Covers of Graphs.	ISAAC	2001	DBLP DOI BibTeX RDF
29	Fanica Gavril, Alon Itai	Covering a Tree by a Forest.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	vertex-cover of a tree by a forest, edge-cover of a tree by a forest, graph algorithms
29	J. Orestes Cerdeira, Leonor Santiago Pinto	Requiring Connectivity in the Set Covering Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	integer polytopes, graphs, set covering, connected components
29	Sridhar Dasika, Sarma B. K. Vrudhula, Kaviraj Chopra, R. Srinivasan	A Framework for Battery-Aware Sensor Management.	DATE	2004	DBLP DOI BibTeX RDF
27	Mikkel Abrahamsen, William Bille Meyling, André Nusser	Constructing Concise Convex Covers via Clique Covers (CG Challenge).	SoCG	2023	DBLP DOI BibTeX RDF
27	Joseph A. Thas, Koen Thas	Covers of generalized quadrangles, 2. Kantor-Knuth covers and embedded ovoids.	Finite Fields Their Appl.	2021	DBLP DOI BibTeX RDF
27	Christian Trefftz, Zack Kurmas, Jerry Scripps	Covers, partitions and a heuristic to calculate two-covers.	EIT	2017	DBLP DOI BibTeX RDF
27	Jonas Hägglund, Klas Markström	Shortest cycle covers and cycle double covers with large 2-regular subgraphs.	CoRR	2013	DBLP BibTeX RDF
27	Beth Malmskog, Michelle Manes	Ramified Covers of Graphs and the Ihara Zeta Functions of Certain Ramified Covers.	WIN - Women in Numbers	2011	DBLP BibTeX RDF
27	Dezheng Xie, Cun-Quan Zhang	Flows, flow-pair covers and cycle double covers.	Discret. Math.	2009	DBLP DOI BibTeX RDF
27	Robbie Allen, Laura E. Hunter	Active Directory Cookbook - solutions for administrators and developers: covers 500 recipes, covers SP1, R2, and ADAM (2. ed.).		2006	RDF
27	Patrice Belleville	On Restricted Boundary Covers and Convex Three-Covers.	CCCG	1993	DBLP BibTeX RDF
27	Krishnamurthy Vidyasankar	Covers and strong covers in directed bipartite graphs.	J. Graph Theory	1980	DBLP DOI BibTeX RDF
26	Yuri Pogudin	Simulation Of Fine-Grained Parallel Algorithms With The ALT (Animated Language Tools) System.	DIS-RT	1997	DBLP DOI BibTeX RDF	fine-grained parallel algorithms simulation, ALT system, Animated Language Tools, textual elements, algorithm behaviour visualization, source representation, functional details, binding covers mechanism, parallel substitution algorithm model, interactive graphic forms, data structure display, source-code functional elements, graphical data objects, equivalent transformations optimization, parallel algorithms, C language, language interface
26	Lior Shabtay, Adrian Segall	Low Complexity Network Synchronization.	WDAG	1994	DBLP DOI BibTeX RDF	sparse covers, communication and time complexities, networks, distributed algorithms, synchronization
26	John C. Hart, Thomas A. DeFanti	Efficient antialiased rendering of 3-D linear fractals.	SIGGRAPH	1991	DBLP DOI BibTeX RDF	object instancing, ray tracing, fractal, procedural modeling, covers
26	Edward Omiecinski	A Parallel Algorithm for Relational Database Normalization.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	relational database normalization, database normalization, relation schemes, third normal form algorithm, serial algorithms, minimal covers, parallel algorithm, parallel algorithms, relational databases, correctness, functional dependencies
26	Carlo Zaniolo, Michel A. Melkanoff	On the Design of Relational Database Schemata.	ACM Trans. Database Syst.	1981	DBLP DOI BibTeX RDF	decompositon, minimal covers, schema design, relational databases, functional dependencies, multivalued dependencies
25	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
25	M. Stuart Lynn	The battle of the covers.	Commun. ACM	2008	DBLP DOI BibTeX RDF
25	Rainer Böhme	Weighted Stego-Image Steganalysis for JPEG Covers.	Information Hiding	2008	DBLP DOI BibTeX RDF
25	Costas Busch, Ryan LaFortune, Srikanta Tirthapura	Improved sparse covers for graphs excluding a fixed minor.	PODC	2007	DBLP DOI BibTeX RDF	minor free graph, path separator, sparse cover, planar graph, compact routing
25	Markus Schedl, Peter Knees, Tim Pohle, Gerhard Widmer	Towards Automatic Retrieval of Album Covers.	ECIR	2006	DBLP DOI BibTeX RDF
25	Dominique de Caen, Dmitry Fon-Der-Flaass	Distance Regular Covers of Complete Graphs from Latin Squares.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF
25	Karl Auinger, Gracinda M. S. Gomes, Victoria Gould, Benjamin Steinberg	An application of a Theorem of Ash to finite covers.	Stud Logica	2004	DBLP DOI BibTeX RDF	weakly left quasi-ample semigroup, proper cover
25	Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu 0001	Minimal Covers of Formal Languages.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
25	Robert T. Firla, Günter M. Ziegler	Hilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
25	Karin Sobottka, Horst Bunke, Heino Kronenberg	Identification of Text on Colored Book and Journal Covers.	ICDAR	1999	DBLP DOI BibTeX RDF
25	Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle	Complexity of Colored Graph Covers I. Colored Directed Multigraphs.	WG	1997	DBLP DOI BibTeX RDF
25	Hervé Brönnimann, Michael T. Goodrich	Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version).	SCG	1994	DBLP DOI BibTeX RDF
25	Georg Gottlob	Computing Covers for Embedded Functional Dependencies.	PODS	1987	DBLP DOI BibTeX RDF
23	Maria João Ferreira, Jorge Picado	On Point-finiteness in Pointfree Topology.	Appl. Categorical Struct.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 06D22, 06A23, 54C30
23	Chih-Chung Lai, Chuan-Kang Ting, Ren-Song Ko	An effective genetic algorithm to improve wireless sensor network lifetime for large-scale surveillance applications.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
23	Sushil K. Prasad, Akshaye Dhawan	Distributed Algorithms for Lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets.	HiPC	2007	DBLP DOI BibTeX RDF
23	Zoë Abrams, Ashish Goel, Serge A. Plotkin	Set k-cover algorithms for energy efficient monitoring in wireless sensor networks.	IPSN	2004	DBLP DOI BibTeX RDF	wireless sensor networks, energy conservation, analysis of algorithms
23	Hideo Fujiwara	A New Definition and a New Class of Sequential Circuits with Combinational Test Generation Complexity.	VLSI Design	2000	DBLP DOI BibTeX RDF	complexity, test generation, design for testability, sequential circuits, reducibility, partial scan, Balanced structure
21	Vince Bárány, Georg Gottlob, Martin Otto 0001	Querying the Guarded Fragment.	LICS	2010	DBLP DOI BibTeX RDF	hypergraph covers, conjunctive queries, descriptive complexity, finite model theory, guarded fragment
21	C. A. Johnson	Computing Only Minimal Answers in Disjunctive Deductive Databases.	J. Autom. Reason.	2009	DBLP DOI BibTeX RDF	Disjunctive deductive databases, Minimal answers, Perfect models, Disjunctive stable models, Cyclic sets, Strong covers, Database pre-processing, Compilation
21	Zhou Xu 0001, Liang Xu	Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time.	ISAAC	2009	DBLP DOI BibTeX RDF	min-max vehicle routing, approximation algorithm, inapproximability, path covers
21	Rémi Lehn, Henri Briand, Fabrice Guillet	User-System Interaction for Redundancy-Free Knowledge Discovery in Data.	Statistical Implicative Analysis	2008	DBLP DOI BibTeX RDF	Minimal Covers, Interpretation of Association Rules, Closure, Deductive Reasonning
21	Monique Guignard 0001, Ellis L. Johnson, Kurt Spielberg	Logical Processing for Integer Programming.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	reduction to minimal preferred inequalities, covers of low degrees, persistence of signs, double contraction, reduction schemes, integer programming, probing, logical processing, disaggregation
21	Herbert Fleischner, Stefan Szeider	On Edge-Colored Graphs Covered by Properly Colored Cycles.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Properly colored cycles, 1-Extendable graphs, Cycle covers, Edge-colored graphs
21	Hsiao Ping Lee, Yin-Te Tsai, Chuan Yi Tang	A seriate coverage filtration approach for homology search.	SAC	2004	DBLP DOI BibTeX RDF	incrementally decreasing covers, longest increasing subsequence problems, lossless filtration, seriate coverage, homology search
21	Chor Ping Low, Hon Wai Leong	A New Class of Efficient Algorithms for Reconfiguration of Memory Arrays.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF	RRAMs, NP-completeness, throughput, heuristic algorithms, vertex covers, sparsity
21	Allen S. Parrish, Stuart H. Zweben	On the Relationships Among the All-Uses, All-DU-Paths, and All-Edges Testing Criteria.	IEEE Trans. Software Eng.	1995	DBLP DOI BibTeX RDF	subsumes, covers, data flow testing, Adequacy criteria
21	Edith Cohen	Fast algorithms for constructing t-spanners and paths with stretch t	FOCS	1993	DBLP DOI BibTeX RDF	pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph
21	Thaddeus Kobylarz, Atef Al-Najjar	An Examination of the Cost Function for Programmable Logic Arrays.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	programmable logic arrays (PLA's), cyclic tables, minimal covers, multiple output combinational circuits, minimization, Cost functions
19	Koji Momihara	Strong difference families, difference covers, and their applications for relative difference families.	Des. Codes Cryptogr.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05B10, 05B05, 94B25
19	András Sebö	Path Partitions, Cycle Covers and Integer Decomposition.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF
19	Ivona Bezáková, William A. Rummler	Sampling Edge Covers in 3-Regular Graphs.	MFCS	2009	DBLP DOI BibTeX RDF
19	Peter Damaschke, Azam Sheikh Muhammad	Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity.	FCT	2009	DBLP DOI BibTeX RDF
19	Milos Ivkovic, Shashi Kiran Chilappagari, Bane Vasic	Eliminating Trapping Sets in Low-Density Parity-Check Codes by Using Tanner Graph Covers.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
19	Sounaka Mishra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	König Deletion Sets and Vertex Covers above the Matching Size.	ISAAC	2008	DBLP DOI BibTeX RDF
19	Ferruh Özbudak, Burcu Gülmez Temur	Fibre products of Kummer covers and curves with many points.	Appl. Algebra Eng. Commun. Comput.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 11G20, 14G15, 14H25
19	Ajoy Kumar Datta, Maria Gradinariu Potop-Butucaru, Rajesh Patel, Ai Yamazaki	Self* Minimum Connected Covers of Query Regions in Sensor Networks.	SSS	2007	DBLP DOI BibTeX RDF
19	Bodo Manthey	Minimum-Weight Cycle Covers and Their Approximability.	WG	2007	DBLP DOI BibTeX RDF
19	Benjamin Doerr, Daniel Johannsen	Adjacency list matchings: an ideal genotype for cycle covers.	GECCO	2007	DBLP DOI BibTeX RDF	randomized local, evolutionary algorithm, search, runtime analysis, cycle cover, Euler tour
19	Andrew E. M. Lewis	The Jump Classes of Minimal Covers.	CiE	2006	DBLP DOI BibTeX RDF
19	Éric Grégoire, Bertrand Mazure, Cédric Piette	Tracking MUSes and Strict Inconsistent Covers.	FMCAD	2006	DBLP DOI BibTeX RDF
19	Zeev Nutov	Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
19	Orlando Lee, Aaron Williams	Packing Dicycle Covers in Planar Graphs with No K5-e Minor.	LATIN	2006	DBLP DOI BibTeX RDF
19	Adam Bliss, Francis Edward Su	Lower Bounds for Simplicial Covers and Triangulations of Cubes.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
19	Mikhail Ju. Moshkov	On Construction of the Set of Irreducible Partial Covers.	SAGA	2005	DBLP DOI BibTeX RDF	Irreducible partial cover, totally polynomial algorithm
19	Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha	Improved Approximations for Tour and Tree Covers.	Algorithmica	2004	DBLP DOI BibTeX RDF	Approximation algorithms, Graph algorithms, Network design
19	Jung-Heum Park	One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.	COCOON	2004	DBLP DOI BibTeX RDF
19	Markus Bläser, Bodo Manthey	Two Approximation Algorithms for 3-Cycle Covers.	APPROX	2002	DBLP DOI BibTeX RDF
19	Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma	Vertex Covers by Edge Disjoint Cliques.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C80, 05C35
19	Karin Sobottka, Heino Kronenberg, T. Perroud, Horst Bunke	Text extraction from colored book and journal covers.	Int. J. Document Anal. Recognit.	2000	DBLP DOI BibTeX RDF	Automatic text location, Information retrieval, Color image processing
19	Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha	Improved approximations for tour and tree covers.	APPROX	2000	DBLP DOI BibTeX RDF
19	Jianhua Chen 0003	The Generalized Logic of only Knowing (GOL) that Covers the Notion of Epistemic Specifications.	ISMIS	1994	DBLP DOI BibTeX RDF
19	Jim Diederich	Minimal Covers Revisited: Correct and Efficient Algorithms.	SIGMOD Rec.	1991	DBLP DOI BibTeX RDF
19	Robin W. Dawes	Minimum Odd Neighbourhood Covers for Trees.	Great Lakes Computer Science Conference	1989	DBLP DOI BibTeX RDF
19	Marie-Paule Flé, Gérard Roucairol	Fair serializability of iterated transactions using FIFO-nets.	European Workshop on Applications and Theory in Petri Nets	1984	DBLP DOI BibTeX RDF	maximal serializability, Petri-nets (FIFO-Nets), concurrency, fair
19	Oliver Vornberger	Alternative Cycle Covers and Paths.	WG	1980	DBLP DOI BibTeX RDF
17	Pankaj K. Agarwal, Esther Ezra, Shashidhara K. Ganjugunte	Efficient Sensor Placement for Surveillance Problems.	DCOSS	2009	DBLP DOI BibTeX RDF
17	Christian Lomp, Virgínia Rodrigues	Covering Coalgebras and Dual Non-singularity.	Appl. Categorical Struct.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 16S90, 16W30
17	Yuta Harada, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita	The Balanced Edge Cover Problem.	ISAAC	2008	DBLP DOI BibTeX RDF