Sciweavers

59 search results - page 10 / 12
» External Memory Stream Sampling
Sort
View
DAC
2003
ACM
15 years 10 months ago
Compiler-generated communication for pipelined FPGA applications
In this paper, we describe a set of compiler analyses and an implementation that automatically map a sequential and un-annotated C program into a pipelined implementation, targete...
Heidi E. Ziegler, Mary W. Hall, Pedro C. Diniz
ECCV
2004
Springer
15 years 11 months ago
Adaptive Probabilistic Visual Tracking with Incremental Subspace Update
Visual tracking, in essence, deals with non-stationary data streams that change over time. While most existing algorithms are able to track objects well in controlled environments,...
David A. Ross, Jongwoo Lim, Ming-Hsuan Yang
JMLR
2002
133views more  JMLR 2002»
14 years 9 months ago
Learning Precise Timing with LSTM Recurrent Networks
The temporal distance between events conveys information essential for numerous sequential tasks such as motor control and rhythm detection. While Hidden Markov Models tend to ign...
Felix A. Gers, Nicol N. Schraudolph, Jürgen S...
DAWAK
1999
Springer
15 years 1 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
STACS
2007
Springer
15 years 3 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler