Sciweavers

10048 search results - page 170 / 2010
» The Structure and Performance of Interpreters
Sort
View
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 8 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
AIPS
2009
15 years 5 months ago
Improving Planning Performance Using Low-Conflict Relaxed Plans
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisficing planning and is used by many state-of-the-art heuristic-search planners. Ho...
Jorge A. Baier, Adi Botea
CIARP
2008
Springer
15 years 6 months ago
Structural Construction for On-Line Mathematical Formulae Recognition
We present a method for on-line mathematical formulae recognition based on the structural construction paradigm and twodimensional grammars. In general, this approach can be succes...
Daniel Prusa, Václav Hlavác
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
16 years 4 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 10 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza