Sciweavers

420 search results - page 30 / 84
» Volume in General Metric Spaces
Sort
View
IPL
2008
111views more  IPL 2008»
14 years 9 months ago
Flying over a polyhedral terrain
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
Hamid Zarrabi-Zadeh
CORR
2007
Springer
91views Education» more  CORR 2007»
14 years 9 months ago
Unequal dimensional small balls and quantization on Grassmann Manifolds
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
Wei Dai, Brian Rider, Youjian Liu
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
INFOCOM
2003
IEEE
15 years 3 months ago
Big-Bang Simulation for embedding network distances in Euclidean space
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
Yuval Shavitt, Tomer Tankel
ECAI
2008
Springer
14 years 11 months ago
Author Identification Using a Tensor Space Representation
Author identification is a text categorization task with applications in intelligence, criminal law, computer forensics, etc. Usually, in such cases there is shortage of training t...
Spyridon Plakias, Efstathios Stamatatos