Sciweavers

1272 search results - page 22 / 255
» The Set Cover with Pairs Problem
Sort
View
CCCG
2001
14 years 17 days ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
ICASSP
2010
IEEE
13 years 11 months ago
Cover song detection: From high scores to general classification
Existing cover song detection systems require prior knowledge of the number of cover songs in a test set in order to identify cover(s) to a reference song. We describe a system th...
Suman Ravuri, Daniel P. W. Ellis
PTS
2000
108views Hardware» more  PTS 2000»
14 years 16 days ago
Determination of Test Configurations for Pair-Wise Interaction Coverage
Systems constructed from components, including distributed systems, consist of a number of elements that interact with each other. As the number of network elements or interchangea...
Alan W. Williams
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
13 years 11 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
CORR
2006
Springer
164views Education» more  CORR 2006»
13 years 11 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey