Sciweavers

2137 search results - page 256 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
CVPR
2006
IEEE
16 years 11 days ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 7 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
ICASSP
2009
IEEE
16 years 1 months ago
Exploiting T-junctions for depth segregation in single images
Occlusion is one of the major consequences of the physical image generation process: it occurs when an opaque object partly obscures the view of another object further away from t...
Mariella Dimiccoli, Philippe Salembier
ICLP
2007
Springer
16 years 14 days ago
Static Region Analysis for Mercury
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
Quan Phan, Gerda Janssens
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
16 years 8 days ago
Limitations of quantum coset states for graph isomorphism
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
Sean Hallgren, Cristopher Moore, Martin Rötte...