Sciweavers

2593 search results - page 343 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
CGF
2004
151views more  CGF 2004»
15 years 2 months ago
Deferred Splatting
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 6 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
228
Voted
ICDE
2006
IEEE
206views Database» more  ICDE 2006»
16 years 3 months ago
Query Co-Processing on Commodity Hardware
The rapid increase in the data volumes for the past few decades has intensified the need for high processing power for database and data mining applications. Researchers have acti...
Anastassia Ailamaki, Naga K. Govindaraju, Dinesh M...
121
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 2 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
COMPGEOM
2008
ACM
15 years 4 months ago
Untangling triangulations through local explorations
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...
Pankaj K. Agarwal, Bardia Sadri, Hai Yu