Sciweavers

1414 search results - page 40 / 283
» Cover Time and Broadcast Time
Sort
View
ICMCS
2008
IEEE
143views Multimedia» more  ICMCS 2008»
14 years 4 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
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 3 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
IJCAI
1997
13 years 11 months ago
Tractable Cover Compilations
Tractable covers are introduced as a new ap­ proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen­ eral framework is presented. Then, two ...
Yacine Boufkhad, Éric Grégoire, Pier...
DAM
2006
191views more  DAM 2006»
13 years 10 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
14 years 4 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis