Sciweavers

157 search results - page 12 / 32
» Size space tradeoffs for resolution
Sort
View
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 9 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
VISUALIZATION
2003
IEEE
14 years 27 days ago
Hierarchical Splatting of Scattered Data
Numerical particle simulations and astronomical observations create huge data sets containing uncorrelated 3D points of varying size. These data sets cannot be visualized interact...
Matthias Hopf, Thomas Ertl
TPDS
2008
89views more  TPDS 2008»
13 years 7 months ago
Power/Performance/Thermal Design-Space Exploration for Multicore Architectures
Multicore architectures have been ruling the recent microprocessor design trend. This is due to different reasons: better performance, thread-level parallelism bounds in modern app...
Matteo Monchiero, Ramon Canal, Antonio Gonzá...
IPPS
2006
IEEE
14 years 1 months ago
Exploring the design space of an optimized compiler approach for mesh-like coarse-grained reconfigurable architectures
In this paper we study the performance improvements and trade-offs derived from an optimized mapping approach applied on a parametric coarse grained reconfigurable array architect...
Grigoris Dimitroulakos, Michalis D. Galanis, Const...
AMAI
2005
Springer
13 years 7 months ago
Toward leaner binary-clause reasoning in a satisfiability solver
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
Allen Van Gelder