Sciweavers

4850 search results - page 808 / 970
» Approximate Data Structures with Applications
Sort
View
116
Voted
CORR
2007
Springer
162views Education» more  CORR 2007»
14 years 10 months ago
Exploiting Social Annotation for Automatic Resource Discovery
Information integration applications, such as mediators or mashups, that require access to information resources currently rely on users manually discovering and integrating them ...
Anon Plangprasopchok, Kristina Lerman
JDA
2008
84views more  JDA 2008»
14 years 10 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
CGF
2004
151views more  CGF 2004»
14 years 10 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»
14 years 9 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
96
Voted
IPPS
2010
IEEE
14 years 8 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...