Sciweavers

870 search results - page 89 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
15 years 2 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya
BMCBI
2010
147views more  BMCBI 2010»
14 years 10 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...
ICASSP
2011
IEEE
14 years 1 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
AI
2010
Springer
14 years 10 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
CIVR
2006
Springer
139views Image Analysis» more  CIVR 2006»
15 years 1 months ago
Finding People Frequently Appearing in News
Abstract. We propose a graph based method to improve the performance of person queries in large news video collections. The method benefits from the multi-modal structure of videos...
Derya Ozkan, Pinar Duygulu