Sciweavers

968 search results - page 42 / 194
» A faster implementation of APlace
Sort
View
126
Voted
SIGMOD
1994
ACM
99views Database» more  SIGMOD 1994»
15 years 8 months ago
Optimizing Queries on Files
We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both). A key issu...
Mariano P. Consens, Tova Milo
ICFCA
2007
Springer
15 years 7 months ago
Performances of Galois Sub-hierarchy-building Algorithms
Abstract. The Galois Sub-hierarchy (GSH) is a polynomial-size representation of a concept lattice which has been applied to several fields, such as software engineering and linguis...
Gabriela Arévalo, Anne Berry, Marianne Huch...
ANOR
2007
58views more  ANOR 2007»
15 years 4 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
USENIX
1996
15 years 5 months ago
A Hierarchical Internet Object Cache
: This paper discussesthedesignandperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trac...
Anawat Chankhunthod, Peter B. Danzig, Chuck Neerda...
JRTIP
2008
77views more  JRTIP 2008»
15 years 3 months ago
MinGPU: a minimum GPU library for computer vision
In the field of computer vision, it is becoming increasingly popular to implement algorithms, in sections or in their entirety, on a graphics processing unit (GPU). This is due to ...
Pavel Babenko, Mubarak Shah