Sciweavers

1220 search results - page 84 / 244
» Restricting grammatical complexity
Sort
View
99
Voted
ICDE
2010
IEEE
233views Database» more  ICDE 2010»
15 years 8 months ago
Polynomial heuristics for query optimization
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
Nicolas Bruno, César A. Galindo-Legaria, Mi...
123
Voted
LATA
2010
Springer
15 years 7 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
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...
Christophe Costa Florêncio, Henning Fernau
144
Voted
3DIM
1999
IEEE
15 years 7 months ago
Hand-Held Acquisition of 3D Models with a Video Camera
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...
Marc Pollefeys, Reinhard Koch, Maarten Vergauwen, ...
98
Voted
ISLPED
1998
ACM
95views Hardware» more  ISLPED 1998»
15 years 7 months ago
The petrol approach to high-level power estimation
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-...
Rafael Peset Llopis, Kees G. W. Goossens
93
Voted
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
15 years 6 months ago
Relationships Among PL, #L, and the Determinant
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...
Eric Allender, Mitsunori Ogihara