Sciweavers

1973 search results - page 170 / 395
» The Construction of Ludic Space
Sort
View
CVPR
2001
IEEE
16 years 8 months ago
Bending Invariant Representations for Surfaces
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...
Asi Elad (Elbaz), Ron Kimmel
CVPR
2005
IEEE
16 years 8 months ago
Random Subspaces and Subsampling for 2-D Face Recognition
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
Nitesh V. Chawla, Kevin W. Bowyer
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 7 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
16 years 6 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
INFOCOM
2009
IEEE
16 years 1 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei