Sciweavers

49 search results - page 10 / 10
» Online linear optimization and adaptive routing
Sort
View
ICPR
2008
IEEE
13 years 11 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
COCOA
2009
Springer
13 years 9 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
ESANN
2006
13 years 6 months ago
Magnification control for batch neural gas
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
Barbara Hammer, Alexander Hasenfuss, Thomas Villma...
FOCS
2010
IEEE
13 years 2 months ago
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
Moritz Hardt, Guy N. Rothblum