42 search results - page 6 / 9 » On the Maximum Cardinality Search Lower Bound for Treewidth |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
ADHOC
2007
13 years 7 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
TCOM
2010
13 years 6 months ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
PAMI
2008
13 years 7 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 ...