1091 search results - page 126 / 219 » Approximation Algorithms for Data Placement Problems |
NIPS
2007
13 years 9 months ago
2007
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
ICCS
2001
Springer
14 years 13 days ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...