Sciweavers

173 search results - page 22 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
JCB
2006
140views more  JCB 2006»
13 years 7 months ago
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
Eran Halperin, Elad Hazan
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)
GECCO
2003
Springer
137views Optimization» more  GECCO 2003»
14 years 23 days ago
The Spatially-Dispersed Genetic Algorithm
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...
Grant Dick