Sciweavers

479 search results - page 94 / 96
» cn 2008
Sort
View
FUIN
2008
71views more  FUIN 2008»
13 years 11 months ago
Nonterminal Complexity of Some Operations on Context-Free Languages
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
Jürgen Dassow, Ralf Stiebe
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
13 years 10 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
14 years 8 days ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
FOCS
2008
IEEE
13 years 12 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
AI
2008
Springer
13 years 11 months ago
An experimental evaluation of simplicity in rule learning
While recent research on rule learning has focussed largely on finding highly accurate hypotheses, we evaluate the degree to which these hypotheses are also simple, that is small....
Ulrich Rückert, Luc De Raedt