Sciweavers

71 search results - page 5 / 15
» Embedding a set of rational points in lower dimensions
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Spherical Cubes and Rounding in High Dimensions
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigders...
ICCV
2007
IEEE
14 years 10 months ago
Discriminant Embedding for Local Image Descriptors
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and visual recognition. However, such descriptors are generally par...
Gang Hua, Matthew Brown, Simon A. J. Winder
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
13 years 8 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 3 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
ICML
2007
IEEE
14 years 9 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal