Sciweavers

955 search results - page 151 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
ISNN
2007
Springer
15 years 3 months ago
Extensions of Manifold Learning Algorithms in Kernel Feature Space
Manifold learning algorithms have been proven to be capable of discovering some nonlinear structures. However, it is hard for them to extend to test set directly. In this paper, a ...
Yaoliang Yu, Peng Guan, Liming Zhang
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
14 years 10 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
CORR
2004
Springer
133views Education» more  CORR 2004»
14 years 9 months ago
Information theory, multivariate dependence, and genetic network inference
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
Ilya Nemenman
WINE
2010
Springer
129views Economy» more  WINE 2010»
14 years 7 months ago
Optimal Pricing in the Presence of Local Network Effects
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...
Ozan Candogan, Kostas Bimpikis, Asuman E. Ozdaglar
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 2 months ago
The Kalman like particle filter: Optimal estimation with quantized innovations/measurements
— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...
Ravi Teja Sukhavasi, Babak Hassibi