5595 search results - page 808 / 1119 » Approximation Algorithms for Clustering Problems |
319
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
175
click to vote
KDD
2009
ACM
16 years 1 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, ...
190
click to vote
PODC
2006
ACM
16 years 20 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
210
click to vote
AIPS
2009
15 years 7 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
222
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...