6365 search results - page 355 / 1273 » Fast Local Computation Algorithms |
198
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
151
Voted
AI
2003
Springer
16 years 23 min ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
213
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
We present a new fast approach for surface segmentation of thin structures, like vessels and vascular trees, based on Fast Marching and Level Sets methods. Fast Marching allows se...
191
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper introduces a rotation invariant extension to the blur insensitive local phase quantization texture descriptor. The new method consists of two stages, the first of whic...
166
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...