Sciweavers

1272 search results - page 50 / 255
» The Set Cover with Pairs Problem
Sort
View
89
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
Target-Oriented Scheduling in Directional Sensor Networks
— Unlike convectional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical con...
Yanli Cai, Wei Lou, Minglu Li, X.-Y. Li
ALGORITHMICA
2008
88views more  ALGORITHMICA 2008»
15 years 26 days ago
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
Andreas Björklund, Thore Husfeldt
CJ
2008
69views more  CJ 2008»
15 years 25 days ago
Some Parameterized Problems On Digraphs
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
Gregory Gutin, Anders Yeo
93
Voted
CSL
2007
Springer
15 years 4 months ago
Logical Refinements of Church's Problem
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
Alexander Rabinovich, Wolfgang Thomas
127
Voted
EMMCVPR
2001
Springer
15 years 5 months ago
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
Laurent D. Cohen, Thomas Deschamps