6251 search results - page 160 / 1251 » Randomness, Computability, and Density |
146
click to vote
PKDD
2004
Springer
15 years 9 months ago
2004
Springer
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
163
click to vote
VLSM
2005
Springer
15 years 9 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
140
click to vote
PDP
2006
IEEE
15 years 10 months ago
2006
IEEE
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
106
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
116
Voted
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.