Sciweavers

16430 search results - page 799 / 3286
» On Computable Tree Functions
Sort
View
ATAL
2010
Springer
15 years 8 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
208
Voted
BMCBI
2007
133views more  BMCBI 2007»
15 years 7 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja
202
Voted
CN
2002
82views more  CN 2002»
15 years 7 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
270
Voted
CVPR
2009
IEEE
16 years 5 months ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...
247
Voted
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
16 years 2 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel