Sciweavers

1091 search results - page 150 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ANNPR
2008
Springer
13 years 10 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
14 years 9 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
ICPR
2000
IEEE
14 years 9 months ago
Estimation of Adaptive Parameters for Satellite Image Deconvolution
The deconvolution of blurred and noisy satellite images is an ill-posed inverse problem, which can be regularized within a Bayesian context by using an a priori model of the recon...
André Jalobeanu, Josiane Zerubia, Laure Bla...
ICCV
2009
IEEE
15 years 1 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
ICML
2007
IEEE
14 years 8 months ago
Simpler core vector machines with enclosing balls
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...
András Kocsor, Ivor W. Tsang, James T. Kwok