Sciweavers

1059 search results - page 64 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
PARA
2000
Springer
15 years 1 months ago
Experiments in Separating Computational Algorithm from Program Distribution and Communication
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
Raphael B. Yehezkael, Yair Wiseman, H. G. Mendelba...
ICDT
2009
ACM
166views Database» more  ICDT 2009»
15 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ACL
2007
14 years 11 months ago
Inducing Combinatory Categorial Grammars with Genetic Algorithms
This paper proposes a novel approach to the induction of Combinatory Categorial Grammars (CCGs) by their potential affinity with the Genetic Algorithms (GAs). Specifically, CCGs...
Elias Ponvert
PODC
2006
ACM
15 years 3 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
BMCBI
2008
140views more  BMCBI 2008»
14 years 10 months ago
Improved accuracy of multiple ncRNA alignment by incorporating structural information into a MAFFT-based framework
Background: Structural alignment of RNAs is becoming important, since the discovery of functional non-coding RNAs (ncRNAs). Recent studies, mainly based on various approximations ...
Kazutaka Katoh, Hiroyuki Toh