Sciweavers

1447 search results - page 218 / 290
» Graphs and Path Equilibria
Sort
View
VLSID
2002
IEEE
105views VLSI» more  VLSID 2002»
16 years 6 months ago
A Heuristic for Clock Selection in High-Level Synthesis
Clock selection has a significant impact on the performance and quality of designs in high-level synthesis. In most synthesis systems, a convenient value of the clock is chosen or...
J. Ramanujam, Sandeep Deshpande, Jinpyo Hong, Mahm...
ICALP
2009
Springer
16 years 6 months ago
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Erik D. Demaine, Gad M. Landau, Oren Weimann
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
16 years 1 months ago
Potential field guide for humanoid multicontacts acyclic motion planning
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
Karim Bouyarmane, Adrien Escande, Florent Lamiraux...
STACS
2007
Springer
16 years 14 days ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
16 years 14 days ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck