Sciweavers

2693 search results - page 148 / 539
» On Computing Complex Navigation Functions
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 10 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
BMCBI
2006
98views more  BMCBI 2006»
15 years 6 months ago
Scanning sequences after Gibbs sampling to find multiple occurrences of functional elements
Background: Many DNA regulatory elements occur as multiple instances within a target promoter. Gibbs sampling programs for finding DNA regulatory elements de novo can be prohibiti...
Kannan Tharakaraman, Leonardo Mariño-Ram&ia...
ICCS
2004
Springer
15 years 11 months ago
Towards a Generalised Runtime Environment for Parallel Haskells
Abstract. Implementations of parallel dialects (or: coordination languages) on a functional base (or: computation) language always have to extend complex runtime environments by th...
Jost Berthold
BMVC
2000
15 years 7 months ago
Morphological Change Detection Algorithms for Surveillance Applications
Vision-based systems for remote surveillance usually involve change detection algorithms for intruders, obstacles or irregularities detection. In particular, there is a potentiall...
Elena Stringa
ICNP
2006
IEEE
16 years 15 days ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam