1220 search results - page 227 / 244 » Restricting grammatical complexity |
STOC
1998
ACM
13 years 11 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
CVPR
1997
IEEE
13 years 11 months ago
1997
IEEE
The surface growing framework presented by Besl and Jain [2] has served as the basis for many range segmentation techniques. It has been augmented with alternative fitting techni...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...