406 search results - page 67 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
MMS
2008
14 years 9 months ago
2008
We address the challenge of semantic gap reduction for image retrieval through an improved SVM-based active relevance feedback framework, together with a hybrid visual and concept...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
ICDAR
2003
IEEE
15 years 2 months ago
2003
IEEE
Neural networks are a powerful technology for classification of visual inputs arising from documents. However, there is a confusing plethora of different neural network methods th...