203 search results - page 39 / 41 » On Span Programs |
118
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
118
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
118
click to vote
MIDDLEWARE
2001
Springer
15 years 6 months ago
2001
Springer
Although it has long been realised that ACID transactions by themselves are not adequate for structuring long-lived applications and much research work has been done on developing...
171
click to vote
WOSP
1998
ACM
15 years 6 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
110
Voted
FASE
2006
Springer
15 years 6 months ago
2006
Springer
Modern software codebases are frequently large, heterogeneous, and constantly evolving. The languages and tools for software construction, including code builds and configuration m...