1127 search results - page 90 / 226 » Testing the Expansion of a Graph |
SIAMAM
2011
14 years 4 months ago
2011
We consider the problem of locating perfectly conducting cracks and estimating their geometric features from multi-static response matrix measurements at a single or multiple frequ...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
CIVR
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...