450 search results - page 74 / 90 » Estimating Search Tree Size |
MCS
2005
Springer
14 years 1 months ago
2005
Springer
A Half-Against-Half (HAH) multi-class SVM is proposed in this paper. Unlike the commonly used One-Against-All (OVA) and One-Against-One (OVO) implementation methods, HAH is built ...
JMM2
2008
13 years 7 months ago
2008
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
APVIS
2010
13 years 2 months ago
2010
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
INFOCOM
2002
IEEE
14 years 14 days ago
2002
IEEE
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...