3875 search results - page 569 / 775 » Approximation algorithms for the 0-extension problem |
171
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, ...
150
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...
315
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...
180
click to vote
PODC
2006
ACM
16 years 15 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...
209
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 ...