478 search results - page 41 / 96 » A simple expected running time analysis for randomized |
158
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
123
click to vote
JPDC
2006
15 years 5 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
150
Voted
NIPS
2004
15 years 7 months ago
2004
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
152
click to vote
ASPLOS
2004
ACM
15 years 11 months ago
2004
ACM
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
175
click to vote
VIS
2004
IEEE
16 years 6 months ago
2004
IEEE
We present a tool for real-time visualization of motion features in 2D image sequences. The motion is estimated through an eigenvector analysis of the spatiotemporal structure ten...