Sciweavers

221 search results - page 12 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Variance reduction with neighborhood smoothing for local intrinsic dimension estimation
Local intrinsic dimension estimation has been shown to be useful for many tasks such as image segmentation, anomaly detection, and de-biasing global dimension estimates. Of partic...
Kevin M. Carter, Alfred O. Hero
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 1 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
TASE
2008
IEEE
13 years 7 months ago
Sensor Selection in Arbitrary Dimensions
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
Volkan Isler, Malik Magdon-Ismail
DCG
2008
86views more  DCG 2008»
13 years 7 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
13 years 7 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko