Sciweavers

5473 search results - page 811 / 1095
» On the graph isomorphism problem
Sort
View
ECCV
2008
Springer
16 years 8 months ago
Fast Automatic Single-View 3-d Reconstruction of Urban Scenes
We consider the problem of estimating 3-d structure from a single still image of an outdoor urban scene. Our goal is to efficiently create 3-d models which are visually pleasant. W...
Olga Barinova, Vadim Konushin, Anton Yakubenko, Ke...
ECCV
2006
Springer
16 years 8 months ago
Fast, Quality, Segmentation of Large Volumes - Isoperimetric Distance Trees
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
Leo Grady
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
16 years 3 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong
STACS
2010
Springer
16 years 1 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
CCGRID
2009
IEEE
16 years 1 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...