Sciweavers

2570 search results - page 475 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
MOBIHOC
2006
ACM
15 years 9 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
SAC
2005
ACM
15 years 3 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
ICCV
2007
IEEE
15 years 11 months ago
Gradient Feature Selection for Online Boosting
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...
Ting Yu, Xiaoming Liu 0002
CCS
2003
ACM
15 years 3 months ago
Monitoring and early warning for internet worms
After the Code Red incident in 2001 and the SQL Slammer in January 2003, it is clear that a simple self-propagating worm can quickly spread across the Internet, infects most vulne...
Cliff Changchun Zou, Lixin Gao, Weibo Gong, Donald...
CVRMED
1997
Springer
15 years 2 months ago
Design considerations for a computer-vision-enabled ophthalmic augmented reality environment
We have initiated studies towards the design and implementation of an ophthalmic augmented reality environment in order to allow for a more precise laser treatment for ophthalmic...
Jeffrey W. Berger, Michael E. Leventon, Nobuhiko H...