11231 search results - page 2011 / 2247 » Digging for Data Structures |
136
Voted
WSCG
2004
15 years 4 months ago
2004
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
132
click to vote
WSCG
2004
15 years 4 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
105
Voted
NIPS
2003
15 years 4 months ago
2003
A recent area of significant progress in speaker recognition is the use of high level features—idiolect, phonetic relations, prosody, discourse structure, etc. A speaker not on...
100
click to vote
NIPS
2003
15 years 4 months ago
2003
A mobile robot acting in the world is faced with a large amount of sensory data and uncertainty in its action outcomes. Indeed, almost all interesting sequential decision-making d...
122
Voted
PDPTA
2003
15 years 4 months ago
2003
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...