Sciweavers

511 search results - page 18 / 103
» TSP with bounded metrics
Sort
View
TSP
2011
142views more  TSP 2011»
13 years 2 months ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
13 years 7 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
DATESO
2004
81views Database» more  DATESO 2004»
13 years 8 months ago
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search
In this paper pivoting M-tree (PM-tree) is introduced, a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hy...
Tomás Skopal
DAC
1995
ACM
13 years 11 months ago
The Elmore Delay as a Bound for RC Trees with Generalized Input Signals
The Elmore delay is an extremely popular delay metric, particularly for RC tree analysis. The widespread usage of this metric is mainly attributable to it being the most accurate ...
Rohini Gupta, Byron Krauter, Bogdan Tutuianu, John...
AIPS
2008
13 years 9 months ago
Criticality Metrics for Distributed Plan and Schedule Management
We address the problem of coordinating the plans and schedules for a team of agents in an uncertain and dynamic environment. Bounded rationality, bounded communication, subjectivi...
Rajiv T. Maheswaran, Pedro A. Szekely