125 search results - page 4 / 25 » N Semantic Classes are Harder than Two |
110
click to vote
FUN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
OOPSLA
2000
Springer
15 years 1 months ago
2000
Springer
An object encoding translates a language with object primitives to one without. Similarly, a class encoding translates classes into other primitives. Both are important theoretica...
90
Voted
CCCG
2008
14 years 11 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we develop the theory of a new class of two dimensional arrays with sensors on lattice(s) which can be used to construct a virtual array of much larger size through...
TIT
1998
14 years 9 months ago
1998
—A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level construc...