15033 search results - page 207 / 3007 » Complexity Theory and Algorithms |
158
click to vote
SOFSEM
2012
Springer
14 years 6 hour ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
188
click to vote
GIAE
2004
Springer
15 years 9 months ago
2004
Springer
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
115
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
The interaction and integration of agent technology and data mining presents prominent benefits to solve some of challenging issues in individual areas. For instance, data mining ...
136
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
181
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...