Sciweavers

2219 search results - page 57 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
SPAA
2006
ACM
14 years 4 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
CVPR
2010
IEEE
13 years 10 months ago
Multi-view structure computation without explicitly estimating motion
Most existing structure-from-motion methods follow a common two-step scheme, where relative camera motions are estimated in the first step and 3D structure is computed afterward ...
Hongdong Li
ASP
2003
Springer
14 years 3 months ago
Graphs and colorings for answer set programming: Abridged Report
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
Kathrin Konczak, Torsten Schaub, Thomas Linke
ISWC
2003
IEEE
14 years 3 months ago
Unsupervised, Dynamic Identification of Physiological and Activity Context in Wearable Computing
Context-aware computing describes the situation where a wearable / mobile computer is aware of its user’s state and surroundings and modifies its behavior based on this informat...
Andreas Krause, Daniel P. Siewiorek, Asim Smailagi...
ECEASST
2010
13 years 7 months ago
Assemblies as Graph Processes
This short paper explores the potential of embedding-based graph rewriting as a tool for understanding natural computing, and in particular self-assembly. The basic point of view i...
Dirk Janssens