1279 search results - page 151 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
108
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
149
click to vote
AAAI
2011
14 years 1 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
120
click to vote
CAD
2005
Springer
15 years 1 months ago
2005
Springer
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
119
click to vote
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
142
click to vote
SIGECOM
2011
ACM
14 years 4 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...