Sciweavers

373 search results - page 42 / 75
» Nearness and uniform convergence
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
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...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
COLT
2005
Springer
14 years 2 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
CVPR
2008
IEEE
14 years 11 months ago
Bayesian color constancy revisited
Computational color constancy is the task of estimating the true reflectances of visible surfaces in an image. In this paper we follow a line of research that assumes uniform illu...
Peter V. Gehler, Carsten Rother, Andrew Blake, Tho...
VIS
2009
IEEE
216views Visualization» more  VIS 2009»
14 years 10 months ago
Volume Ray Casting with Peak Finding and Differential Sampling
Direct volume rendering and isosurfacing are ubiquitous rendering techniques in scientific visualization, commonly employed in imaging 3D data from simulation and scan sources. Con...
Aaron Knoll, Younis Hijazi, Rolf Westerteiger, ...
ICFP
2002
ACM
14 years 9 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani