Sciweavers

118 search results - page 12 / 24
» Approximation Schemes for Euclidean k-Medians and Related Pr...
Sort
View
TNN
2008
119views more  TNN 2008»
13 years 7 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 8 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
14 years 8 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
ICIP
2005
IEEE
14 years 9 months ago
Presegmentation of high-resolution satellite images with a multifractal reconstruction scheme based on an entropy criterium
The last generation of satellites leads to the very high-resolution images which offer a high quality of detailed information about the Earth's surface. However, the exploita...
Antonio Turiel, Hussein M. Yahia, Jacopo Grazzini
COMPGEOM
2006
ACM
14 years 1 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...