Sciweavers

62 search results - page 4 / 13
» Increasing the Gap between Descriptional Complexity and Algo...
Sort
View
SARA
2005
Springer
15 years 2 months ago
Learning Regular Expressions from Noisy Sequences
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
Ugo Galassi, Attilio Giordana
JCSS
2008
120views more  JCSS 2008»
14 years 9 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
HPDC
2010
IEEE
14 years 10 months ago
Modeling sequence and function similarity between proteins for protein functional annotation
A common task in biological research is to predict function for proteins by comparing sequences between proteins of known and unknown function. This is often done using pair-wise ...
Roger Higdon, Brenton Louie, Eugene Kolker
CORR
2000
Springer
116views Education» more  CORR 2000»
14 years 9 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
STOC
2007
ACM
105views Algorithms» more  STOC 2007»
15 years 9 months ago
Balanced allocations: the weighted case
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
Kunal Talwar, Udi Wieder