Sciweavers

849 search results - page 81 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
TCAD
2008
128views more  TCAD 2008»
13 years 7 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
COSIT
2009
Springer
159views GIS» more  COSIT 2009»
14 years 2 months ago
Adaptable Path Planning in Regionalized Environments
Human path planning relies on several more aspects than only geometric distance between two locations. These additional aspects mostly relate to the complexity of the traveled path...
Kai-Florian Richter
SIGGRAPH
1994
ACM
13 years 12 months ago
Hierarchical spacetime control
Specifying the motion of an animated linked figure such that it achieves given tasks (e.g., throwing a ball into a basket) and performs the tasks in a realistic fashion (e.g., gra...
Zicheng Liu, Steven J. Gortler, Michael F. Cohen
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Robert Hildebrand, Matthias Köppe
PR
2008
90views more  PR 2008»
13 years 7 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan