21324 search results - page 596 / 4265 » Making the case for computing |
197
Voted
ESA
2003
Springer
16 years 15 days ago
2003
Springer
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
177
Voted
ECAI
1992
Springer
15 years 11 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
185
Voted
DAGSTUHL
2000
15 years 8 months ago
2000
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
188
click to vote
SIROCCO
2000
15 years 8 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
186
click to vote
IJHPCA
2006
15 years 7 months ago
2006
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...