Sciweavers

15073 search results - page 79 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
129
Voted
RECOMB
2003
Springer
16 years 3 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
15 years 7 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
ICRA
2005
IEEE
93views Robotics» more  ICRA 2005»
15 years 8 months ago
Robotic Rock Climbing using Computer Vision and Force Feedback
Abstract Climbing robots that climb flat structures using suction cups or magnets are commonly described in the literature. However, robots that can autonomously find randomly plac...
Stephen Paul Linder, Edward Wei, Alexander Clay
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 8 months ago
Memory-based immigrants for genetic algorithms in dynamic environments
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
Shengxiang Yang
CVPR
2007
IEEE
16 years 5 months ago
Learning Conditional Random Fields for Stereo
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...
Daniel Scharstein, Chris Pal