Sciweavers

269 search results - page 12 / 54
» The Quantitative Structure of Exponential Time
Sort
View
MICCAI
2006
Springer
14 years 8 months ago
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
Ali Kemal Sinop, Leo Grady
AVI
2008
13 years 10 months ago
Realizing the hidden: interactive visualization and analysis of large volumes of structured data
An emerging trend in Web computing aims at collecting and integrating distributed data. For instance, community driven efforts recently have build ontological repositories made of...
Olaf Noppens, Thorsten Liebig
CP
2010
Springer
13 years 6 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
KR
2000
Springer
13 years 11 months ago
Satisfiability Algorithms and Finite Quantification
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
Matthew L. Ginsberg, Andrew J. Parkes
INFOCOM
2006
IEEE
14 years 1 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...