1046 search results - page 136 / 210 » Approximation Algorithms for Domination Search |
119
click to vote
PROCEDIA
2010
15 years 1 months ago
2010
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
100
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
113
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
118
Voted
SIGGRAPH
2010
ACM
15 years 7 months ago
2010
ACM
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
118
click to vote
CAAN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...