Sciweavers

4255 search results - page 24 / 851
» Cover
Sort
View
DAC
2005
ACM
14 years 8 months ago
Effective bounding techniques for solving unate and binate covering problems
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...
Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
14 years 7 months ago
The online set cover problem
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbi...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
FSTTCS
2009
Springer
14 years 2 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
22
Voted
ICMCS
2008
IEEE
143views Multimedia» more  ICMCS 2008»
14 years 1 months ago
Music fingerprint extraction for classical music cover song identification
An algorithm for extracting music fingerprints directly from an audio signal is proposed in this paper. The proposed music fingerprint aims to encapsulate various aspects of mus...
Samuel Kim, Erdem Unal, Shrikanth Narayanan