2342 search results - page 128 / 469 » Sublinear geometric algorithms |
100
Voted
COMPGEOM
2000
ACM
15 years 5 months ago
2000
ACM
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
102
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
113
Voted
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
133
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
200
Voted
VLDB
2004
ACM
16 years 1 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...