221 search results - page 31 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
179
click to vote
CALCO
2005
Springer
15 years 11 months ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
167
click to vote
CAD
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
276
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
142
click to vote
IPPS
2008
IEEE
16 years 7 days ago
2008
IEEE
Transactional memory systems promise to reduce the burden of exposing thread-level parallelism in programs by relieving programmers from analyzing complex inter-thread dependences...
138
click to vote
HICSS
1998
IEEE
15 years 10 months ago
1998
IEEE
The National Institute of Standards and Technology (NIST) has developed a form-based handprint recognition system for reading information written on forms. This public domain soft...