2520 search results - page 369 / 504 » The complexity of approximating entropy |
192
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
169
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
206
click to vote
ISVC
2009
Springer
16 years 1 months ago
2009
Springer
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
229
click to vote
KSEM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
195
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...