6274 search results - page 506 / 1255 » From query complexity to computational complexity |
187
click to vote
TOOLS
1999
IEEE
15 years 11 months ago
1999
IEEE
The evolution of software systems over many years often leads to unnecessarily complex and in exible designs which in turn lead to a huge amount of e ort for enhancements and main...
176
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
248
click to vote
CI
2000
15 years 6 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
211
click to vote
BIBE
2005
IEEE
16 years 18 days ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
259
Voted
COMPGEOM
2010
ACM
16 years 1 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...