Sciweavers

3708 search results - page 548 / 742
» Approximating Betweenness Centrality
Sort
View
JMLR
2008
159views more  JMLR 2008»
15 years 6 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
MONET
2006
103views more  MONET 2006»
15 years 6 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
SIAMIS
2008
174views more  SIAMIS 2008»
15 years 6 months ago
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki...
SIGIR
2008
ACM
15 years 6 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 6 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...