Sciweavers

335 search results - page 52 / 67
» Non-negative sparse coding
Sort
View
WWW
2010
ACM
15 years 4 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley
ISVC
2009
Springer
15 years 4 months ago
Edge-Preserving Laplacian Pyramid
5th International Symposium on Visual Computing, Las Vegas, Nevada, USA, Nov 30 - Dec 2, 2009 The Laplacian pyramid recursively splits an image into local averages and local diff...
Stella X. Yu
ISCAS
2007
IEEE
114views Hardware» more  ISCAS 2007»
15 years 4 months ago
A Spike-Based Saccadic Recognition System
Abstract— We present a spike-based saccadic recognition system that uses a temporal-derivative silicon retina on a pan-tilt unit and an aVLSI multi-neuron classifier with a time...
Matthias Oster, Patrick Lichtsteiner, Tobi Delbr&u...
IWMM
2000
Springer
90views Hardware» more  IWMM 2000»
15 years 1 months ago
Compact Garbage Collection Tables
Garbage collection tables for finding pointers on the stack can be represented in 20-25% of the space previously reported. Live pointer information is often the same at many call ...
David Tarditi
PPOPP
1991
ACM
15 years 1 months ago
Coarse-Grain Parallel Programming in Jade
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
Monica S. Lam, Martin C. Rinard