Sciweavers

2200 search results - page 151 / 440
» Bloch's Constant is Computable
Sort
View
ECCC
2011
223views ECommerce» more  ECCC 2011»
15 years 1 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
ECCV
2006
Springer
16 years 8 months ago
Confocal Stereo
We present confocal stereo, a new method for computing 3D shape by controlling the focus and aperture of a lens. The method is specifically designed for reconstructing scenes with ...
Samuel W. Hasinoff, Kiriakos N. Kutulakos
ICPR
2004
IEEE
16 years 7 months ago
Extraction and Clustering of Motion Trajectories in Video
A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clus...
Dan Buzan, George Kollios, Stan Sclaroff
ICPR
2002
IEEE
16 years 7 months ago
Adaptive Kernel Metric Nearest Neighbor Classification
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions due to the curse-ofdimensionality. Sev...
Jing Peng, Douglas R. Heisterkamp, H. K. Dai