554 search results - page 87 / 111 » Approximation algorithms and hardness results for labeled co... |
MLG
2007
Springer
14 years 1 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ALGORITHMICA
2011
13 years 2 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
MM
2009
ACM
14 years 8 days ago
2009
ACM
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...