125 search results - page 4 / 25 » N Semantic Classes are Harder than Two |
206
click to vote
FUN
2010
Springer
15 years 11 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...
157
click to vote
OOPSLA
2000
Springer
15 years 10 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...
190
click to vote
CCCG
2008
15 years 8 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...
196
click to vote
ICASSP
2011
IEEE
14 years 10 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...
181
click to vote
TIT
1998
15 years 6 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...