Sciweavers

2988 search results - page 74 / 598
» Experiments with a New Boosting Algorithm
Sort
View
147
Voted
MMNS
2003
119views Multimedia» more  MMNS 2003»
15 years 6 months ago
A New Available Bandwidth Measurement Technique for Service Overlay Networks
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 11 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
15 years 11 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
CVPR
2009
IEEE
1119views Computer Vision» more  CVPR 2009»
16 years 11 months ago
Adaptive Contour Features in Oriented Granular Space for Human Detection and Segmentation
In this paper, a novel feature named Adaptive Contour Feature (ACF) is proposed for human detection and segmentation. This feature consists of a chain of a number of granules in...
Wei Gao (Tsinghua University), Haizhou Ai (Tsinghu...
CVPR
2005
IEEE
16 years 6 months ago
A Semi-Supervised Active Learning Framework for Image Retrieval
Although recent studies have shown that unlabeled data are beneficial to boosting the image retrieval performance, very few approaches for image retrieval can learn with labeled a...
Steven C. H. Hoi, Michael R. Lyu