Sciweavers

16994 search results - page 3138 / 3399
» Improving the Performance of maxRPC
Sort
View
ICS
1999
Tsinghua U.
15 years 11 months ago
Software trace cache
—This paper explores the use of compiler optimizations which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying ...
Alex Ramírez, Josep-Lluis Larriba-Pey, Carl...
ICCV
1998
IEEE
15 years 11 months ago
Condensing Image Databases when Retrieval is Based on Non-Metric Distances
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
David W. Jacobs, Daphna Weinshall, Yoram Gdalyahu
VLDB
1999
ACM
145views Database» more  VLDB 1999»
15 years 11 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
ASPLOS
1998
ACM
15 years 11 months ago
Space-Time Scheduling of Instruction-Level Parallelism on a Raw Machine
Advances in VLSI technology will enable chips with over a billion transistors within the next decade. Unfortunately, the centralized-resource architectures of modern microprocesso...
Walter Lee, Rajeev Barua, Matthew Frank, Devabhakt...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
« Prev « First page 3138 / 3399 Last » Next »