333 search results - page 18 / 67 » Speeding up moving-target search |
TC
2010
14 years 8 months ago
2010
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
MICCAI
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
CIKM
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The encoding process of image vector quantization (VQ) is very heavy due to it performing a lot of k-dimensional Euclidean distance computations. In order to speed up VQ encoding,...