1091 search results - page 88 / 219 » Approximation Algorithms for Data Placement Problems |
128
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
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...
143
Voted
NIPS
2007
15 years 4 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
146
click to vote
INFOCOM
2010
IEEE
15 years 15 days ago
2010
IEEE
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...
139
Voted
ICFCA
2009
Springer
15 years 9 months ago
2009
Springer
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...
137
click to vote
GRC
2010
IEEE
15 years 3 months ago
2010
IEEE
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...