Sciweavers

2252 search results - page 401 / 451
» Improving Random Forests
Sort
View
CSCW
2012
ACM
13 years 8 months ago
Socializing volunteers in an online community: a field experiment
Although many off-line organizations give their employees training, mentorship, a cohort and other socialization experiences that improve their retention and productivity, online ...
Rosta Farzan, Robert Kraut, Aditya Pal, Joseph A. ...
INFOCOM
2005
IEEE
15 years 6 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
15 years 14 days ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
134
Voted
CVPR
2009
IEEE
16 years 7 months ago
Memory-based particle filter for face pose tracking robust under complex dynamics
A novel particle filter, the Memory-based Particle Filter (M-PF), is proposed that can visually track moving objects that have complex dynamics. We aim to realize robustness aga...
Dan Mikami (NTT), Kazuhiro Otsuka (NTT), Junji YAM...
CVPR
2001
IEEE
16 years 2 months ago
Affine Arithmetic Based Estimation of Cue Distributions in Deformable Model Tracking
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
Siome Goldenstein, Christian Vogler, Dimitris N. M...