3991 search results - page 368 / 799 » Bounding homogeneous models |
246
click to vote
CIAC
2006
Springer
15 years 11 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
229
click to vote
COLT
2006
Springer
15 years 11 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
165
click to vote
ICPP
1987
IEEE
15 years 11 months ago
1987
IEEE
Abstract. We address the problem of designing and building efficient custom Vl.Sl-besed processors to do computations on large multi-dimensional lattices. The design tradeoffs for ...
211
click to vote
COMPGEOM
2008
ACM
15 years 9 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
212
click to vote
CPAIOR
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...