Sciweavers

158 search results - page 27 / 32
» Depth as Randomness Deficiency
Sort
View
ARITH
2007
IEEE
14 years 2 months ago
Optimistic Parallelization of Floating-Point Accumulation
Abstract— Floating-point arithmetic is notoriously nonassociative due to the limited precision representation which demands intermediate values be rounded to fit in the availabl...
Nachiket Kapre, André DeHon
3DIM
2005
IEEE
14 years 1 months ago
A MRF Formulation for Coded Structured Light
Multimedia projectors and cameras make possible the use of structured light to solve problems such as 3D reconstruction, disparity map computation and camera or projector calibrat...
Jean-Philippe Tardif, Sébastien Roy
SPAA
2005
ACM
14 years 1 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
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 1 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
SPAA
2004
ACM
14 years 1 months ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...