6939 search results - page 394 / 1388 » Algorithm Engineering for Parallel Computation |
121
click to vote
FOSSACS
2004
Springer
15 years 9 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
134
click to vote
DLOG
2010
15 years 1 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
130
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
150
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. In this paper, a new camera calibration algorithm is proposed, which is from the quasi-affine invariance of two parallel circles. Two parallel circles here mean two circl...
137
click to vote
CF
2009
ACM
15 years 10 months ago
2009
ACM
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...