192 search results - page 38 / 39 » Nondeterminism in Constructive Z |
ARSCOM
2005
14 years 9 months ago
2005
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...
IPL
2007
14 years 9 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
104
click to vote
CC
1998
Springer
14 years 9 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
107
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Shape matching has many applications in computer vision, such as shape classification, object recognition, object detection, and localization. In 2D cases, shape instances are 2D c...
IJRR
2010
14 years 4 months ago
2010
Several recent studies have investigated the problem of object feature extraction with artificial whiskers. Many of these studies have used an approach in which the whisker is rot...