Sciweavers

502 search results - page 73 / 101
» Streaming Random Forests
Sort
View
TALG
2010
74views more  TALG 2010»
14 years 10 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
3DPVT
2006
IEEE
186views Visualization» more  3DPVT 2006»
15 years 5 months ago
Resolution Scalable Coding and Region of Interest Access with Three-Dimensional SBHP Algorithm
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...
Ying Liu, William A. Pearlman
SIGCOMM
1993
ACM
15 years 3 months ago
The Synchronization of Periodic Routing Messages
The paper considers a network with many apparently-independent periodic processes and discusses one method by which these processes can inadvertently become synchronized. In parti...
Sally Floyd, Van Jacobson
IEEEHPCS
2010
14 years 10 months ago
3-SAT on CUDA: Towards a massively parallel SAT solver
This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...
Quirin Meyer, Fabian Schonfeld, Marc Stamminger, R...
IACR
2011
113views more  IACR 2011»
13 years 11 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose