Sciweavers

957 search results - page 184 / 192
» Tracking by Sampling Trackers
Sort
View
ICCV
2007
IEEE
14 years 9 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
ICIP
1999
IEEE
14 years 9 months ago
Data Embedding in Text for a Copier System
In this paper, we present a scheme for embedding data in copies (color or monochrome) of predominantly text pages that may also contain color images or graphics. Embedding data im...
Anoop K. Bhattacharjya, Hakan Ancin
PLDI
2009
ACM
14 years 8 months ago
Efficiently and precisely locating memory leaks and bloat
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
PERCOM
2003
ACM
14 years 7 months ago
Using Peer-to-Peer Data Routing for Infrastructure-Based Wireless Networks
A mobile ad-hoc network is an autonomous system of mobile routers that are self-organizing and completely decentralized with no requirements for dedicated infrastructure support. ...
Sethuram Balaji Kodeswaran, Olga Ratsimore, Anupam...