15485 search results - page 431 / 3097 » Computing Optimal Subsets |
231
click to vote
CRYPTO
2003
Springer
16 years 2 days ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
193
click to vote
SMA
2010
ACM
15 years 7 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
272
click to vote
CAD
2011
Springer
15 years 1 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
178
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
152
click to vote
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
Maximum likelihood (ML) estimation is widely used in many computer vision problems involving the estimation of geometric parameters, from conic fitting to bundle adjustment for s...