1220 search results - page 62 / 244 » Restricting grammatical complexity |
IRI
2007
IEEE
14 years 2 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
GRAPHITE
2004
ACM
14 years 1 months ago
2004
ACM
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
DELTA
2002
IEEE
14 years 19 days ago
2002
IEEE
In the upcoming high transmission rate system, based on code division multiple access, standard multi-user detection methods are restricted because of performance and implementati...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...