1139 search results - page 97 / 228 » Bounded Ideation Theory |
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
DFG
2007
Springer
14 years 1 months ago
2007
Springer
: Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerge...
AINA
2008
IEEE
13 years 11 months ago
2008
IEEE
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed t...
ACL
1990
13 years 10 months ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...