Sciweavers

760 search results - page 138 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Segmentation by transduction
This paper addresses the problem of segmenting an image into regions consistent with user-supplied seeds (e.g., a sparse set of broad brush strokes). We view this task as a statis...
Florent Ségonne, Jean Ponce, Jean-Yves Audi...
CVPR
2008
IEEE
14 years 9 months ago
Matching non-rigidly deformable shapes across images: A globally optimal solution
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
Thomas Schoenemann, Daniel Cremers
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
14 years 7 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 7 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 7 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan