Sciweavers

2570 search results - page 341 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
15 years 1 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
170
Voted
BROADNETS
2007
IEEE
15 years 9 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ICCV
2009
IEEE
16 years 6 months ago
Image Saliency by Isocentric Curvedness and Color
In this paper we propose a novel computational method to infer visual saliency in images. The method is based on the idea that salient objects should have local characteristics tha...
Roberto Valenti
CVPR
2005
IEEE
16 years 5 months ago
Infomax Boosting
In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maxi...
Siwei Lyu
ECCV
2008
Springer
16 years 5 months ago
Dynamic Integration of Generalized Cues for Person Tracking
Abstract. We present an approach for the dynamic combination of multiple cues in a particle filter-based tracking framework. The proposed algorithm is based on a combination of dem...
Kai Nickel, Rainer Stiefelhagen