Sciweavers

2969 search results - page 77 / 594
» A space efficient algorithm for group structure computation
Sort
View
140
Voted
CVPR
2008
IEEE
16 years 5 months ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
JEI
2006
82views more  JEI 2006»
15 years 3 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 7 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
DAM
2008
114views more  DAM 2008»
15 years 3 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 3 months ago
Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...
Mugurel Ionut Andreica