221 search results - page 31 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
186
Voted
CALCO
2005
Springer
15 years 12 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 ...
177
Voted
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...
284
Voted
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...
150
Voted
IPPS
2008
IEEE
16 years 23 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...
141
Voted
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...