Sciweavers

2434 search results - page 454 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CVPR
2004
IEEE
16 years 2 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
CVPR
2006
IEEE
16 years 2 months ago
Semi-Supervised Classification Using Linear Neighborhood Propagation
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
Fei Wang, Changshui Zhang, Helen C. Shen, Jingdong...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 24 days ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
16 years 21 days ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
115
Voted
SOSP
2009
ACM
15 years 9 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...