811 search results - page 143 / 163 » Avoiding Approximate Squares |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
ICDE
2011
IEEE
13 years 1 months ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
FGR
2011
IEEE
13 years 1 months ago
2011
IEEE
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
CVPR
2012
IEEE
12 years 8 days ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
TVCG
2012
12 years 8 days ago
2012
—In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topol...