Sciweavers

246 search results - page 41 / 50
» Calibrating Random Forests
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Rate-constrained distributed distance testing and its applications
We investigate a practical approach to solving one instantiation of a distributed hypothesis testing problem under severe rate constraints that shows up in a wide variety of appli...
Chuohao Yeo, Parvez Ahammad, Hao Zhang, Kannan Ram...
CVPR
1998
IEEE
14 years 10 months ago
Using Adaptive Tracking to Classify and Monitor Activities in a Site
We describe a vision system that monitors activity in a site over extended periods of time. The system uses a distributed set of sensors to cover the site, and an adaptive tracker...
W. Eric L. Grimson, Chris Stauffer, R. Romano, L. ...
CSDA
2008
128views more  CSDA 2008»
13 years 8 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 3 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
MOBIHOC
2012
ACM
11 years 11 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang