Sciweavers

502 search results - page 65 / 101
» Streaming Random Forests
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
CVPR
2011
IEEE
13 years 6 months ago
Coupled Information-Theoretic Encoding for Face Photo-Sketch Recognition
Automatic face photo-sketch recognition has important applications to law enforcement. Recent research has focused on transforming photos and sketches into the same modality for m...
Wei Zhang, Xiaogang Wang, Xiaoou Tang
CVPR
2011
IEEE
13 years 6 months ago
Learning to Find Occlusion Regions
For two consecutive frames in a video, we identify which pixels in the first frame become occluded in the second. Such general-purpose detection of occlusion regions is difficul...
Ahmad Humayun, Oisin Mac Aodha, Gabriel Brostow
ICASSP
2011
IEEE
13 years 1 months ago
Time-frequency segmentation of bird song in noisy acoustic environments
Recent work in machine learning considers the problem of identifying bird species from an audio recording. Most methods require segmentation to isolate each syllable of bird call ...
Lawrence Neal, Forrest Briggs, Raviv Raich, Xiaoli...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 10 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff