Sciweavers

666 search results - page 125 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
ICRA
2006
IEEE
103views Robotics» more  ICRA 2006»
14 years 3 months ago
A Time-budgeted Collision Detection Method
- Collision detection is a critical module in many applications such as computer graphics, robot motion planning, physical simulation, CAD/CAM, and molecular modeling. Many efficie...
Yu-Te Lin, Tsai-Yen Li
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 3 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
SI3D
2005
ACM
14 years 2 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 2 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
LICS
1997
IEEE
14 years 1 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard