7150 search results - page 29 / 1430 » An Approximation Algorithm for Approximation Rank |
91
Voted
AAAI
2008
15 years 2 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
94
Voted
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
107
Voted
SIAMMAX
2010
14 years 7 months ago
2010
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
115
Voted
FQAS
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
ECIR
2008
Springer
15 years 1 months ago
2008
Springer
An expert search system assists users with their "expertise need" by suggesting people with relevant expertise to their query. Most systems work by ranking documents in r...