6365 search results - page 1002 / 1273 » Fast Local Computation Algorithms |
182
click to vote
IJCV
2012
13 years 9 months ago
2012
Abstract Image alignment in the presence of non-rigid distortions is a challenging task. Typically, this involves estimating the parameters of a dense deformation field that warps...
185
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
165
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...
196
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
226
click to vote
PODC
2004
ACM
16 years 4 days ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...