418 search results - page 9 / 84 » On the Adders with Minimum Tests |
INFORMATICALT
2011
13 years 2 months ago
2011
It is well known that in situations involving the study of large datasets where influential observations or outliers maybe present, regression models based on the Maximum Likeliho...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
DAGM
2007
Springer
14 years 1 months ago
2007
Springer
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
IPCO
2008
13 years 9 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ASE
2010
13 years 7 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...