Sciweavers

4930 search results - page 622 / 986
» Learning minimal abstractions
Sort
View
OSDI
2008
ACM
16 years 7 months ago
Digging for Data Structures
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....
EDBT
2006
ACM
118views Database» more  EDBT 2006»
16 years 7 months ago
On Honesty in Sovereign Information Sharing
Abstract. We study the following problem in a sovereign informationsharing setting: How to ensure that the individual participants, driven solely by self-interest, will behave hone...
Rakesh Agrawal, Evimaria Terzi
ALT
2009
Springer
16 years 3 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
ALT
2009
Springer
16 years 3 months ago
Complexity versus Agreement for Many Views
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
Odalric-Ambrym Maillard, Nicolas Vayatis
ALT
2002
Springer
16 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...