1686 search results - page 191 / 338 » Programs as polygraphs: computability and complexity |
168
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
149
click to vote
VLSI
2010
Springer
14 years 10 months ago
2010
Springer
Future systems will have to support multiple and concurrent dynamic compute-intensive applications, while respecting real-time and energy consumption constraints. To overcome these...
163
click to vote
ESWS
2011
Springer
14 years 7 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
127
click to vote
JPDC
2011
14 years 6 months ago
2011
Scripting languages such as R and Matlab are widely used in scientific data processing. As the data volume and the complexity of analysis tasks both grow, sequential data process...
143
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...