614 search results - page 65 / 123 » Local Computation: Lower and Upper Bounds |
102
click to vote
TPDS
2010
14 years 8 months ago
2010
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
FPGA
1999
ACM
15 years 2 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
108
click to vote
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
Two problems occur when bundle adjustment (BA) is applied on long image sequences: the large calculation time and the drift (or error accumulation). In recent work, the calculatio...
GD
2008
Springer
14 years 11 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
FGR
2004
IEEE
15 years 1 months ago
2004
IEEE
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...