Sciweavers

3192 search results - page 387 / 639
» The minimum latency problem
Sort
View
COMPGEOM
1994
ACM
15 years 8 months ago
Matching Shapes with a Reference Point
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
Helmut Alt, Oswin Aichholzer, Günter Rote
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 8 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
CISS
2007
IEEE
15 years 8 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
DAGM
2007
Springer
15 years 8 months ago
Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
GLOBECOM
2007
IEEE
15 years 8 months ago
Efficient Scheduling for Heterogeneous Services in OFDMA Downlink
We consider optimal allocation of resources to users in a downlink OFDMA system to support heterogeneous applications consisting of both deadline-sensitive (DS) and best-effort (BE...
Rajiv Agarwal, Vinay R. Majjigi, Rath Vannithamby,...