Sciweavers

1091 search results - page 88 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 2 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...
NIPS
2007
13 years 9 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
INFOCOM
2010
IEEE
13 years 5 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
ICFCA
2009
Springer
14 years 2 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
GRC
2010
IEEE
13 years 9 months ago
Optimal Factorization of Three-Way Binary Data
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
Radim Belohlávek, Vilém Vychodil