736 search results - page 114 / 148 » Algorithms for Ordinal Arithmetic |
STOC
2009
ACM
16 years 13 days ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
178
click to vote
POPL
2007
ACM
16 years 3 days ago
2007
ACM
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
105
click to vote
STOC
2006
ACM
16 years 3 days ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
120
click to vote
CODES
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, we present the analysis, design and implementation of an estimator to realize large bit width unsigned integer multiplier units. Larger multiplier units are require...
107
click to vote
DGCI
2005
Springer
15 years 5 months ago
2005
Springer
A new approach to ray tracing implicit surfaces based on recursive space subdivision is presented in this paper. Interval arithmetic, already used to calculate intersections in ray...