1086 search results - page 120 / 218 » Points surrounding the origin |
103
Voted
ECCC
2007
15 years 1 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
PRL
2008
15 years 1 months ago
2008
It is a conventional belief that line-based approaches perform better than point-based ones for homography estimation, as the linefitting is generally more noise resistant than po...
106
click to vote
IJCAT
2007
15 years 1 months ago
2007
: This paper proposes the Enhanced Shrinking and Expanding Algorithm (ESEA) with a new categorization method. The ESEA overcomes anomalies in the original Shrinking and Expanding A...
114
click to vote
AICOM
2004
15 years 1 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
119
click to vote
NJC
2000
15 years 1 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...