1554 search results - page 121 / 311 » Parameterized Complexity and Approximation Algorithms |
127
Voted
ATMOS
2007
15 years 5 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
106
Voted
PAKDD
2005
ACM
15 years 9 months ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
203
Voted
VLDB
2001
ACM
16 years 3 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
154
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
176
Voted
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...