1702 search results - page 294 / 341 » Doomed program points |
COMPGEOM
2003
ACM
14 years 1 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...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
PLDI
2010
ACM
14 years 1 months ago
2010
ACM
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
MICRO
2002
IEEE
14 years 1 months ago
2002
IEEE
Data prefetching effectively reduces the negative effects of long load latencies on the performance of modern processors. Hardware prefetchers employ hardware structures to predic...
SIGGRAPH
1993
ACM
14 years 17 days ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...