5316 search results - page 248 / 1064 » Which Search Problems Are Random |
155
click to vote
IDEAS
2003
IEEE
15 years 10 months ago
2003
IEEE
Overlay networks have received a lot of attention due to the recent wide-spread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through repli...
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
224
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
133
click to vote
UIST
2006
ACM
15 years 10 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
146
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...