Sciweavers

808 search results - page 93 / 162
» On the Estimation of Join Result Sizes
Sort
View
EOR
2007
159views more  EOR 2007»
13 years 10 months ago
Solving the semi-desirable facility location problem using bi-objective particle swarm
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
Haluk Yapicioglu, Alice E. Smith, Gerry V. Dozier
MVA
2008
130views Computer Vision» more  MVA 2008»
13 years 10 months ago
Fast pattern recognition using normalized grey-scale correlation in a pyramid image representation
The ability to quickly locate one or more instances of a model in a grey scale image is of importance to industry. The recognition/localization must be fast and accurate. In this p...
W. James MacLean, John K. Tsotsos
ICML
2004
IEEE
14 years 11 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
WWW
2009
ACM
14 years 5 months ago
Threshold selection for web-page classification with highly skewed class distribution
We propose a novel cost-efficient approach to threshold selection for binary web-page classification problems with imbalanced class distributions. In many binary-classification ta...
Xiaofeng He, Lei Duan, Yiping Zhou, Byron Dom
AAAI
2006
14 years 1 days ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch