Sciweavers

96 search results - page 9 / 20
» How Fast Can Higher-Order Masking Be in Software
Sort
View
136
Voted
SIGGRAPH
1995
ACM
15 years 7 months ago
Fast multiresolution image querying
We present a method for searching in an image database using a query image that is similar to the intended target. The query image may be a hand-drawn sketch or a (potentially low...
Charles E. Jacobs, Adam Finkelstein, David Salesin
119
Voted
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 3 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
153
Voted
ASPLOS
2004
ACM
15 years 9 months ago
Compiler orchestrated prefetching via speculation and predication
This paper introduces a compiler-orchestrated prefetching system as a unified framework geared toward ameliorating the gap between processing speeds and memory access latencies. ...
Rodric M. Rabbah, Hariharan Sandanagobalane, Mongk...
ARCS
2006
Springer
15 years 7 months ago
Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures
: Given is the following "creature's exploration problem": n creatures are moving around in an unknown environment in order to visit all cells in shortest time. This...
Mathias Halbach, Rolf Hoffmann
93
Voted
ICASSP
2011
IEEE
14 years 7 months ago
DSP evolution from a teaching point of view
In this paper the authors are addressing the concerns associated with fast growing DSP chips and tools and the impact they have on teaching DSP implementation. The authors also pr...
Naim Dahnoun, Jason Brand