Sciweavers

2219 search results - page 345 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
130
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 2 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
128
Voted
COORDINATION
2009
Springer
16 years 3 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
127
Voted
BMEI
2008
IEEE
15 years 9 months ago
A New Approach for Tree Alignment Based on Local Re-Optimization
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
Feng Yue, Jijun Tang
CVPR
2009
IEEE
16 years 9 months ago
Discriminative Subvolume Search for Efficient Action Detection
Actions are spatio-temporal patterns which can be characterized by collections of spatio-temporal invariant features. Detection of actions is to find the re-occurrences (e.g. th...
Junsong Yuan (Northwestern University), Zicheng Li...