Sciweavers

1403 search results - page 252 / 281
» Set cover algorithms for very large datasets
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
14 years 3 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman
COMAD
2009
13 years 9 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
CVPR
2005
IEEE
14 years 10 months ago
A Generative Model of Human Hair for Hair Sketching
Human hair is a very complex visual pattern whose representation is rarely studied in the vision literature despite its important role in human recognition. In this paper, we prop...
Hong Chen, Song Chun Zhu
ECCV
2006
Springer
14 years 10 months ago
A Learning Based Approach for 3D Segmentation and Colon Detagging
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...
Zhuowen Tu, Xiang Zhou, Dorin Comaniciu, Luca Bogo...
ECCV
2002
Springer
14 years 10 months ago
On Affine Invariant Clustering and Automatic Cast Listing in Movies
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
Andrew W. Fitzgibbon, Andrew Zisserman