501 search results - page 74 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
AAAI
2006
13 years 9 months ago
2006
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
CAD
2004
Springer
13 years 7 months ago
2004
Springer
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...