1220 search results - page 84 / 244 » Restricting grammatical complexity |
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
LATA
2010
Springer
14 years 26 days ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
3DIM
1999
IEEE
14 years 2 days ago
1999
IEEE
Modeling of 3D objects from image sequences is a challenging problem and has been a research topic for many years. Important theoretical and algorithmic results were achieved that...
ISLPED
1998
ACM
13 years 12 months ago
1998
ACM
High-level power estimation is essential for designing complex low-power ICs. However, the lack of flexibility, or restriction to synthesizable code of previously presented high-...
COCO
1994
Springer
13 years 12 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...