Sciweavers

2100 search results - page 51 / 420
» Fundamentals of the problem
Sort
View
ICALP
2007
Springer
14 years 4 months ago
Holographic Algorithms: The Power of Dimensionality Resolved
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
Jin-yi Cai, Pinyan Lu
DEXAW
1999
IEEE
128views Database» more  DEXAW 1999»
14 years 2 months ago
Conflict Resolution and Reconciliation in Disconnected Databases
As mobile computing devices become more and more popular, mobile databases have started gaining popularity. An important feature of these database systems is their ability to allo...
Shirish Hemant Phatak, B. R. Badrinath
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 10 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
14 years 10 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
ALT
2009
Springer
14 years 1 months ago
Learning and Domain Adaptation
Domain adaptation is a fundamental learning problem where one wishes to use labeled data from one or several source domains to learn a hypothesis performing well on a different, y...
Yishay Mansour