2957 search results - page 123 / 592 » The Complexity of Polynomial-Time Approximation |
TGC
2007
Springer
14 years 4 months ago
2007
Springer
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
SAS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
ICML
2004
IEEE
14 years 3 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
CONCUR
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...