Sciweavers

176 search results - page 23 / 36
» Unbalanced Points and Vertices Problem
Sort
View
NIPS
2003
14 years 10 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
201
Voted
COMPGEOM
2011
ACM
14 years 1 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
92
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
15 years 3 months ago
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
Haim Kaplan, Natan Rubin, Micha Sharir
77
Voted
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
14 years 9 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...