1333 search results - page 105 / 267 » Not a Number of Floating Point Problems |
133
click to vote
SDM
2009
SIAM
16 years 29 days ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
119
Voted
PREMI
2005
Springer
15 years 9 months ago
2005
Springer
We address the problem of fusing sparse and noisy depth data obtained from a range finder with features obtained from intensity images to estimate ego-motion and refine 3D struct...
164
Voted
IEEEMSP
2002
IEEE
15 years 8 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
159
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
156
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...