Sciweavers

329 search results - page 20 / 66
» On Range Searching with Semialgebraic Sets
Sort
View
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 8 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
PR
2007
100views more  PR 2007»
13 years 8 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
JCDL
2004
ACM
88views Education» more  JCDL 2004»
14 years 2 months ago
A query interface for an event gazetteer
We introduce an event gazetteer which stores and presents “locations in time”. Each event is coded with attributes of event type, location, actor, and beginning and ending tim...
Robert B. Allen
SCIA
2005
Springer
110views Image Analysis» more  SCIA 2005»
14 years 2 months ago
Training Cellular Automata for Image Processing
Experiments were carried out to investigate the possibility of training cellular automata to to perform processing. Currently, only binary images are considered, but the space of r...
Paul L. Rosin
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 5 months ago
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre