Sciweavers

4155 search results - page 399 / 831
» External Memory Algorithms
Sort
View
TC
2010
15 years 1 months ago
Performance Comparison of Graphics Processors to Reconfigurable Logic: A Case Study
A systematic approach to the comparison of the graphics processor (GPU) and reconfigurable logic is defined in terms of three throughput drivers. The approach is applied to five ca...
Ben Cope, Peter Y. K. Cheung, Wayne Luk, Lee W. Ho...
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
16 years 1 months ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
LCTRTS
2007
Springer
16 years 1 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
CIKM
2008
Springer
15 years 9 months ago
Winnowing-based text clustering
We present an approach to document clustering based on winnowing fingerprints that achieved good values of effectiveness with considerable save in memory space and computation tim...
Javier Parapar, Alvaro Barreiro