Sciweavers

791 search results - page 82 / 159
» Approximating the Maximum Sharing Problem
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
NA
2010
104views more  NA 2010»
13 years 2 months ago
New interpolants for asymptotically correct defect control of BVODEs
The defect of a continuous approximate solution to an ODE is the amount by which that approximation fails to satisfy the ODE. A number of studies have explored the use of asymptot...
Wayne H. Enright, P. H. Muir
ICML
1999
IEEE
14 years 8 months ago
Machine-Learning Applications of Algorithmic Randomness
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
Volodya Vovk, Alexander Gammerman, Craig Saunders
JCO
2006
153views more  JCO 2006»
13 years 7 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
CORR
2011
Springer
187views Education» more  CORR 2011»
13 years 2 months ago
Global Stability Analysis of Fluid Flows using Sum-of-Squares
This paper introduces a new method for proving global stability of fluid flows through the construction of Lyapunov functionals. For finite dimensional approximations of fluid...
Paul Goulart, Sergei Chernyshenko