4913 search results - page 235 / 983 » Results and Perspectives of the G |
162
Voted
COMPGEOM
2006
ACM
16 years 19 days ago
2006
ACM
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
163
click to vote
HAPTICS
2005
IEEE
16 years 8 days ago
2005
IEEE
Our experience with a Haptic Workstation™ has shown that this device is uncomfortable to use during long sessions. The main reason is the uncomfortable posture of the arms, whic...
139
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper summarises the achievements of a multidisciplinary Bioinformatics project which has the objective of providing a general mechanism for efficient computerisation of type...
220
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
194
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...