691 search results - page 69 / 139 » Using Classifiers to Solve Warehouse Location Problems |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
JMLR
2008
14 years 10 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...