Sciweavers

2168 search results - page 268 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
127
Voted
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
15 years 9 months ago
Optimizing Topology and Parameters of Gene Regulatory Network Models from Time-Series Experiments
Abstract. In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. Different approaches to infer the dependencies of gene r...
Christian Spieth, Felix Streichert, Nora Speer, An...
142
Voted
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
CVPR
2004
IEEE
16 years 5 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
CVPR
2007
IEEE
16 years 5 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára
117
Voted
RECOMB
2004
Springer
16 years 3 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh