4539 search results - page 357 / 908 » Approaches to Compute Workflow Complexity |
202
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
167
Voted
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
Two basic problems in image interpretation are: a) determining which interpretations are the most plausible amoungst many possibilities; and b) controlling the search for plausibl...
185
click to vote
ICDCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
157
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
166
Voted
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...