Sciweavers

921 search results - page 141 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
CONEXT
2005
ACM
15 years 6 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
143
Voted
CSL
2010
Springer
15 years 5 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
DEXA
2000
Springer
132views Database» more  DEXA 2000»
15 years 8 months ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
JDA
2008
87views more  JDA 2008»
15 years 3 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
232
Voted
ASPLOS
2011
ACM
14 years 7 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...