Sciweavers

339 search results - page 33 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
85
Voted
HIPC
2003
Springer
15 years 2 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
85
Voted
DCC
2010
IEEE
15 years 4 months ago
Block Compressed Sensing of Images Using Directional Transforms
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
Sungkwang Mun, James E. Fowler
CVPR
2004
IEEE
15 years 11 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...
CCGRID
2008
IEEE
15 years 4 months ago
Scalable Data Gathering for Real-Time Monitoring Systems on Distributed Computing
Real-time monitoring is increasingly becoming important in various scenes of large scale, multi-site distributed/parallel computing, e.g, understanding behavior of systems, schedu...
Yoshikazu Kamoshida, Kenjiro Taura
ICDCS
2009
IEEE
15 years 6 months ago
FlashLite: A User-Level Library to Enhance Durability of SSD for P2P File Sharing
Peer-to-peer file sharing is popular, but it generates random write traffic to storage due to the nature of swarming. NAND flash memory based Solid-State Drive (SSD) technology...
Hyojun Kim, Umakishore Ramachandran