4865 search results - page 438 / 973 » The Complexity of Graph Connectivity |
160
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
210
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
195
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
192
click to vote
LCPC
2009
Springer
15 years 11 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
174
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...