224 search results - page 13 / 45 » The optimal sequenced route query |
SIGIR
2005
ACM
15 years 7 months ago
2005
ACM
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
153
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
140
click to vote
SIGMETRICS
2010
ACM
15 years 4 days ago
2010
ACM
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
NSDI
2004
15 years 3 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
122
Voted
COMCOM
2008
15 years 1 months ago
2008
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...