Sciweavers

344 search results - page 68 / 69
» A constant factor approximation algorithm for a class of cla...
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
12 years 12 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
13 years 10 months ago
Price prediction and insurance for online auctions
Online auctions are generating a new class of fine-grained data about online transactions. This data lends itself to a variety of applications and services that can be provided to...
Rayid Ghani
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 5 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
13 years 10 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
13 years 11 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer