Sciweavers

2200 search results - page 239 / 440
» Bloch's Constant is Computable
Sort
View
SMILE
1998
Springer
15 years 10 months ago
From Ordinal to Euclidean Reconstruction with Partial Scene Calibration
Abstract. Since uncalibrated images permit only projective reconstruction, metric information requires either camera or scene calibration. We propose a stratified approach to proje...
Daphna Weinshall, P. Anandan, Michal Irani
SMILE
1998
Springer
15 years 10 months ago
Automatic 3D Model Construction for Turn-Table Sequences
As virtual worlds demand ever more realistic 3D models, attention is being focussed on systems that can acquire graphical models from real objects. This paper describes a system wh...
Andrew W. Fitzgibbon, Geoffrey Cross, Andrew Zisse...
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
15 years 10 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
SPAA
1994
ACM
15 years 10 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
WG
1993
Springer
15 years 10 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...