Sciweavers

6274 search results - page 1116 / 1255
» From query complexity to computational complexity
Sort
View
COMGEO
2010
ACM
15 years 4 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
173
Voted
ALMOB
2006
110views more  ALMOB 2006»
15 years 4 months ago
New journal: Algorithms for Molecular Biology
This editorial announces Algorithms for Molecular Biology, a new online open access journal published by BioMed Central. By launching the first open access journal on algorithmic ...
Burkhard Morgenstern, Peter F. Stadler
FGCS
2008
103views more  FGCS 2008»
15 years 4 months ago
A case for cooperative and incentive-based federation of distributed clusters
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to ma...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
CLUSTER
2006
IEEE
15 years 4 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
JOC
2008
86views more  JOC 2008»
15 years 4 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
« Prev « First page 1116 / 1255 Last » Next »