10608 search results - page 67 / 2122 » Complexity of O'Hara's Algorithm |
ICMCS
2006
IEEE
14 years 4 months ago
2006
IEEE
Text that appears in images contains important and useful information. Detection and extraction of text in images have been used in many applications. In this paper, we propose a ...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...
DCG
2010
13 years 10 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
13 years 10 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...