219 search results - page 25 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
TRANSCI
2011
13 years 3 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
ICASSP
2011
IEEE
13 years 9 days ago
2011
IEEE
Received signal strength (RSS) based source localization papers often ignore the practical effects of range limits in the measurements. In many devices, this results in some senso...
PAMI
2008
13 years 8 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—This paper studies the maximum throughput that can be supported by a given wireless mesh backhaul network, over a practical CSMA/CA medium access control (MAC) protocol. We reso...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...