Sciweavers

249 search results - page 30 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 9 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
3DIM
2001
IEEE
14 years 21 days ago
Combining Off- and On-Line Calibration of a Digital Camera
We introduce a novel outlook on the self-calibration task, by considering images taken by a camera in motion, allowing for zooming and focusing. Apart from the complex relationshi...
Magdalena Urbanek, Radu Horaud, Peter F. Sturm
PR
2011
12 years 12 months ago
A novel multi-view learning developed from single-view patterns
The existing Multi-View Learning (MVL) learns how to process patterns with multiple information sources. In generalization this MVL is proven to have a significant advantage over...
Zhe Wang, Songcan Chen, Daqi Gao
COMPGEOM
2003
ACM
14 years 2 months ago
Curve-sensitive cuttings
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
Vladlen Koltun, Micha Sharir
SIGGRAPH
1998
ACM
14 years 1 months ago
Wires: A Geometric Deformation Technique
Finding effective interactive deformation techniques for complex geometric objects continues to be a challenging problem in modeling and animation. We present an approach that is ...
Karan Singh, Eugene Fiume