264 search results - page 22 / 53 » On the possibility of faster SAT algorithms |
GD
2003
Springer
15 years 5 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
ICPR
2000
IEEE
16 years 27 days ago
2000
IEEE
This paper explores the utilization of adaptive triangular meshes representing gray-level images to accelerate basic image processing operations. In particular, two algorithms for...
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
Openings-by-reconstruction are the oldest connected filters, and indeed, reconstruction methodology lies at the heart of many connected operators such as levelings. Starting out ...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
125
click to vote
DCOSS
2011
Springer
13 years 11 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...