2104 search results - page 115 / 421 » Sorting with networks of data structures |
167
click to vote
SODA
1990
ACM
15 years 5 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
142
click to vote
DEBU
2000
15 years 4 months ago
2000
In a traditional information retrieval system, it is assumed that queries can be posed about any topic. In reality, a large fraction of web queries are posed about a relatively sm...
186
click to vote
SIGMOD
2010
ACM
14 years 11 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
273
click to vote
CGF
2011
14 years 11 months ago
2011
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
401
click to vote
RECOMB
2011
Springer
14 years 7 months ago
2011
Springer
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...