256 search results - page 26 / 52 » Root shadow spaces |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
CGI
1998
IEEE
13 years 12 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
CGF
2008
13 years 7 months ago
2008
In many business applications, large data workloads such as sales figures or process performance measures need to be monitored in real-time. The data analysts want to catch proble...