4523 search results - page 17 / 905 » Using randomization in the teaching of data structures and a... |
ALGORITHMICA
1998
13 years 8 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
BMCBI
2008
13 years 8 months ago
2008
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...