2520 search results - page 145 / 504 » The complexity of approximating entropy |
SI3D
2009
ACM
15 years 5 months ago
2009
ACM
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
IPSN
2009
Springer
15 years 5 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
TAMC
2009
Springer
15 years 5 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
ICRA
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
ADC
2008
Springer
15 years 5 months ago
2008
Springer
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...