2107 search results - page 202 / 422 » Computing Small Search Numbers in Linear Time |
208
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
144
click to vote
PDP
2008
IEEE
15 years 10 months ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
122
Voted
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
As computers inevitably begin to replace humans as the drivers of automobiles, our current human-centric traffic management mechanisms will give way to hyper-efficient systems and...
150
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
133
click to vote
AAAI
2008
15 years 6 months ago
2008
In group decision making, often the agents need to decide on multiple attributes at the same time, so that there are exponentially many alternatives. In this case, it is unrealist...