Sciweavers

1612 search results - page 242 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
DAGM
2005
Springer
15 years 3 months ago
Cluster-Based Point Cloud Analysis for Rapid Scene Interpretation
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...
Eric Wahl, Gerd Hirzinger
ASPDAC
2008
ACM
200views Hardware» more  ASPDAC 2008»
14 years 12 months ago
Non-Gaussian statistical timing analysis using second-order polynomial fitting
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
Lerong Cheng, Jinjun Xiong, Lei He
CVPR
2008
IEEE
14 years 11 months ago
Photometric stereo with coherent outlier handling and confidence estimation
In photometric stereo a robust method is required to deal with outliers, such as shadows and non-Lambertian reflections. In this paper we rely on a probabilistic imaging model tha...
Frank Verbiest, Luc J. Van Gool
NETWORKING
2008
14 years 11 months ago
Cooperative Replication in Content Networks with Nodes under Churn
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
Eva Jaho, Ioannis Z. Koukoutsidis, Ioannis Stavrak...