16404 search results - page 479 / 3281 » A set coverage problem |
166
click to vote
IEEEMSP
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—We present the query-by-description (QBD) component of “Kandem,” a time-aware music retrieval system. The QBD system we describe learns a relation between descriptiv...
192
click to vote
EVOW
2001
Springer
15 years 11 months ago
2001
Springer
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
168
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
191
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...
193
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...