201 search results - page 33 / 41 » Computing nearest neighbors in real time |
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
NAS
2010
IEEE
13 years 6 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
BMCBI
2007
13 years 8 months ago
2007
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...