1326 search results - page 118 / 266 » Approximate Tree Kernels |
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
EMSOFT
2004
Springer
14 years 2 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...