6365 search results - page 1019 / 1273 » Fast Local Computation Algorithms |
183
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
170
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
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...
188
click to vote
SAC
2005
ACM
16 years 8 days ago
2005
ACM
: 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...
203
click to vote
CGF
2010
15 years 4 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
191
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
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...