Sciweavers

2569 search results - page 49 / 514
» Approximate Objects and Approximate Theories
Sort
View
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 5 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...
CGF
2008
98views more  CGF 2008»
14 years 12 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
15 years 5 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICML
1999
IEEE
16 years 19 days ago
Machine-Learning Applications of Algorithmic Randomness
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
Volodya Vovk, Alexander Gammerman, Craig Saunders
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
15 years 4 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella