10608 search results - page 1813 / 2122 » Complexity of O'Hara's Algorithm |
155
click to vote
RT
1999
Springer
15 years 4 months ago
1999
Springer
The dramatically increasing size of polygonal models resulting from 3D scanning devices and advanced modeling techniques requires new approaches to reduce the load of geometry tran...
121
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
106
click to vote
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
135
click to vote
CAPTECH
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...
103
Voted
SIGCOMM
1998
ACM
15 years 4 months ago
1998
ACM
In recent years, a number of link scheduling algorithms have been proposed that greatly improve upon traditional FIFO scheduling in being able to assure rate and delay bounds for ...