Sciweavers

2745 search results - page 133 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
IPPS
2007
IEEE
15 years 10 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
CVPR
2011
IEEE
14 years 11 months ago
Structure from motion for scenes with large duplicate structures
Most existing structure from motion (SFM) approaches for unordered images cannot handle multiple instances of the same structure in the scene. When image pairs containing differen...
Richard Roberts, Sudipta Sinha, Richard Szeliski, ...
ICCV
2011
IEEE
14 years 3 months ago
Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
Yong-Dian Jian, Doru C. Balcan, Frank Dellaert
DAGSTUHL
1997
15 years 5 months ago
Fast and Accurate Collision Detection for Virtual Environments
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
Ming C. Lin
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
15 years 9 months ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle