Sciweavers

2434 search results - page 317 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CVPR
2004
IEEE
16 years 5 months ago
Incremental Density Approximation and Kernel-Based Bayesian Filtering for Object Tracking
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
Bohyung Han, Dorin Comaniciu, Ying Zhu, Larry S. D...
140
Voted
CISS
2008
IEEE
15 years 10 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
SSDBM
2007
IEEE
212views Database» more  SSDBM 2007»
15 years 10 months ago
Adaptive-Size Reservoir Sampling over Data Streams
Reservoir sampling is a well-known technique for sequential random sampling over data streams. Conventional reservoir sampling assumes a fixed-size reservoir. There are situation...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 3 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin
116
Voted
JPDC
2008
129views more  JPDC 2008»
15 years 3 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...