Sciweavers

1421 search results - page 232 / 285
» Algorithms for subsequence combinatorics
Sort
View
MP
2002
86views more  MP 2002»
15 years 2 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
TIP
2002
111views more  TIP 2002»
15 years 2 months ago
Synergizing spatial and temporal texture
Temporal texture accounts for a large proportion of motion commonly experienced in the visual world. Current temporal texture techniques extract primarily motion-based features for...
Chin-Hwee Peh, Loong Fah Cheong
IJCV
2008
157views more  IJCV 2008»
15 years 2 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
ICRA
2010
IEEE
182views Robotics» more  ICRA 2010»
15 years 1 months ago
Ground robot navigation using uncalibrated cameras
Abstract— Precise calibration of camera intrinsic and extrinsic parameters, while often useful, is difficult to obtain during field operation and presents scaling issues for mu...
Olivier Koch, Matthew R. Walter, Albert S. Huang, ...
IEEECIT
2010
IEEE
15 years 1 months ago
Superblock-Based Source Code Optimizations for WCET Reduction
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
Paul Lokuciejewski, Timon Kelter, Peter Marwedel