Sciweavers

511 search results - page 31 / 103
» TSP with bounded metrics
Sort
View
CONCUR
2009
Springer
14 years 2 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 10 months ago
Quantization Bounds on Grassmann Manifolds of Arbitrary Dimensions and MIMO Communications with Feedback
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
Wei Dai, Youjian Liu, Brian Rider
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 11 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
CVPR
2004
IEEE
15 years 26 days ago
Affine Image Registration Using a New Information Metric
We present a new information metric for multimodality image registration. The metric is technically a pseudometric since it satisfies the properties, i) nonnegativity, ii) symmetr...
Jie Zhang, Anand Rangarajan
FOCS
1999
IEEE
14 years 3 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk