Sciweavers

1672 search results - page 68 / 335
» Tightness problems in the plane
Sort
View
FPL
2009
Springer
113views Hardware» more  FPL 2009»
14 years 1 months ago
Clock duplicity for high-precision timestamping in Gigabit Ethernet
Hardware-timestamping is essential for achieving tight synchronization in networking applications. This mechanism is selectively used on few high-cost tailored systems. Actual μP...
Carles Nicolau, Dolors Sala, Enrique Cantó
HYBRID
2000
Springer
14 years 13 days ago
Ellipsoidal Techniques for Reachability Analysis
For the reach tube of a linear time-varying system with ellipsoidal bounds on the control variable consider the following approximation problem. Find a tight ellipsoid-valued tube...
Alexander B. Kurzhanski, Pravin Varaiya
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
14 years 26 days ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein
WAE
2000
95views Algorithms» more  WAE 2000»
13 years 10 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
CVPR
2012
IEEE
11 years 11 months ago
2.5D building modeling by discovering global regularities
We introduce global regularities in the 2.5D building modeling problem, to reflect the orientation and placement similarities between planar elements in building structures. Give...
Qian-Yi Zhou, Ulrich Neumann