Sciweavers

62 search results - page 1 / 13
» Increasing the Gap between Descriptional Complexity and Algo...
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
13 years 12 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
BMCBI
2010
103views more  BMCBI 2010»
13 years 5 months ago
MTRAP: Pairwise sequence alignment algorithm by a new measure based on transition probability between two consecutive pairs of r
Background: Sequence alignment is one of the most important techniques to analyze biological systems. It is also true that the alignment is not complete and we have to develop it ...
Toshihide Hara, Keiko Sato, Masanori Ohya
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 3 days ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
13 years 5 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 5 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking