1686 search results - page 140 / 338 » Programs as polygraphs: computability and complexity |
145
Voted
PPOPP
2012
ACM
13 years 11 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
258
click to vote
Book
"Much of the motivation and effort for this edition is to bring the book up to date with the Java JDK 1.4 release of the language. However, it has also become clear that most ...
109
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
136
click to vote
ICMT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
144
Voted
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...