Sciweavers

3874 search results - page 421 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
FOCS
2003
IEEE
15 years 12 months ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis
HYBRID
2000
Springer
15 years 10 months ago
A Hybrid Feedback Regulator Approach to Control an Automotive Suspension System
Abstract. In this paper, we demonstrate a novel hybrid control synthesis approach using an automotive suspension system. Discrete abstractions are used to approximate the continuou...
Xenofon D. Koutsoukos, Panos J. Antsaklis
CCCG
2007
15 years 8 months ago
Triangulations Loosing Bundles and Weight
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
Cem Boyaci, Hale Erten, Alper Üngör
ACL
1994
15 years 8 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin
189
Voted
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 10 months ago
Orphan-Free Anisotropic Voronoi Diagrams
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
Guillermo D. Cañas, Steven J. Gortler