3172 search results - page 139 / 635 » On the Random-Self-Reducibility of Complete Sets |
225
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
169
click to vote
JGT
2011
15 years 1 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
166
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
What does a blind entity need in order to determine the geometry of the set of photocells that it carries through a changing lightfield? In this paper, we show that very crude know...
173
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper, we discuss the application of the two-dimensio- nal paired representation for processing medical images. This representation leads to the effective solution of the ...
178
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained part...