Sciweavers

2219 search results - page 244 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
MP
2010
145views more  MP 2010»
15 years 5 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
EXPCS
2007
15 years 10 months ago
Analysis of input-dependent program behavior using active profiling
Utility programs, which perform similar and largely independent operations on a sequence of inputs, include such common applications as compilers, interpreters, and document parse...
Xipeng Shen, Michael L. Scott, Chengliang Zhang, S...
RTCSA
2000
IEEE
15 years 11 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
ECCV
2002
Springer
16 years 8 months ago
A Stochastic Algorithm for 3D Scene Segmentation and Reconstruction
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
Feng Han, Zhuowen Tu, Song Chun Zhu
ASPLOS
2009
ACM
16 years 7 months ago
Optimization of tele-immersion codes
As computational power increases, tele-immersive applications are an emerging trend. These applications make extensive demands on computational resources through their heavy use o...
Albert Sidelnik, I-Jui Sung, Wanmin Wu, Marí...