1331 search results - page 100 / 267 » Complexity bounds for zero-test algorithms |
CGI
1998
IEEE
14 years 2 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...
JSAC
2008
13 years 10 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
DCG
2006
13 years 10 months ago
2006
We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the inpu...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
PODS
2005
ACM
14 years 3 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...