Sciweavers

152 search results - page 1 / 31
» On the Implementation of Huge Random Objects
Sort
View
FOCS
2003
IEEE
14 years 7 days ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 1 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
ICIP
2006
IEEE
14 years 8 months ago
Robust Object Detection using Fast Feature Selection from Huge Feature Sets
This paper describes an efficient feature selection method that quickly selects a small subset out of a given huge feature set; for building robust object detection systems. In th...
Duy-Dinh Le, Shin'ichi Satoh
LCPC
2007
Springer
14 years 1 months ago
Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
Ronald Veldema, Michael Philippsen
MICCAI
2005
Springer
14 years 7 months ago
Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation
A new approach to interactive segmentation based on random walks was recently introduced that shows promise for allowing physicians more flexibility to segment arbitrary objects in...
Leo Grady, Thomas Schiwietz, Shmuel Aharon, Rü...