895 search results - page 123 / 179 » Using graphs for some discrete tomography problems |
140
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
187
click to vote
IJCAI
1989
15 years 4 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
103
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
106
click to vote
ARSCOM
2007
15 years 3 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
146
click to vote
JOC
2000
15 years 3 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...