Sciweavers

3360 search results - page 514 / 672
» Opportunistic Data Structures with Applications
Sort
View
122
Voted
CGF
2004
151views more  CGF 2004»
15 years 3 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...
TOG
2002
165views more  TOG 2002»
15 years 3 months ago
CHARMS: a simple framework for adaptive simulation
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can ...
Eitan Grinspun, Petr Krysl, Peter Schröder
IPPS
2010
IEEE
15 years 1 months ago
MMT: Exploiting fine-grained parallelism in dynamic memory management
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...
Devesh Tiwari, Sanghoon Lee, James Tuck, Yan Solih...
SENSYS
2010
ACM
15 years 1 months ago
Revealing the hidden lives of underground animals using magneto-inductive tracking
Currently, there is no existing method for automatically tracking the location of burrowing animals when they are underground, consequently zoologists only have a partial view of ...
Andrew Markham, Niki Trigoni, Stephen A. Ellwood, ...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 1 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud