Sciweavers

72 search results - page 14 / 15
» External Memory Algorithms for String Problems
Sort
View
FOCS
2000
IEEE
13 years 10 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
CPHYSICS
2007
222views more  CPHYSICS 2007»
13 years 5 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
FOCS
2004
IEEE
13 years 9 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
CIKM
2004
Springer
13 years 11 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
CODES
2005
IEEE
13 years 11 months ago
Improving superword level parallelism support in modern compilers
Multimedia vector instruction sets are becoming ubiquitous in most of the embedded systems used for multimedia, networking and communications. However, current compiler technology...
Christian Tenllado, Luis Piñuel, Manuel Pri...