Sciweavers

1059 search results - page 133 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
MOBIHOC
2010
ACM
13 years 6 months ago
On quality of monitoring for multi-channel wireless infrastructure networks
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
Arun Chhetri, Huy Anh Nguyen, Gabriel Scalosub, Ro...
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 3 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
CVPR
2010
IEEE
13 years 9 months ago
A probabilistic framework for joint segmentation and tracking
Most tracking algorithms implicitly apply a coarse segmentation of each target object using a simple mask such as a rectangle or an ellipse. Although convenient, such coarse segme...
Chad Aeschliman, Johnny Park, Avinash C. Kak
ICDM
2009
IEEE
107views Data Mining» more  ICDM 2009»
13 years 6 months ago
Naive Bayes Classification of Uncertain Data
Traditional machine learning algorithms assume that data are exact or precise. However, this assumption may not hold in some situations because of data uncertainty arising from mea...
Jiangtao Ren, Sau Dan Lee, Xianlu Chen, Ben Kao, R...