1041 search results - page 103 / 209 » Randomizing Reductions of Search Problems |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
INFOSCALE
2006
ACM
14 years 1 months ago
2006
ACM
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
CIBCB
2009
IEEE
13 years 9 months ago
2009
IEEE
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
ARCS
2004
Springer
14 years 1 months ago
2004
Springer
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...