Sciweavers

6740 search results - page 413 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
16 years 1 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...
FSTTCS
1994
Springer
15 years 10 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
COLING
2008
15 years 8 months ago
Detecting Multiple Facets of an Event using Graph-Based Unsupervised Methods
We propose a new unsupervised method for topic detection that automatically identifies the different facets of an event. We use pointwise Kullback-Leibler divergence along with th...
Pradeep Muthukrishnan, Joshua Gerrish, Dragomir R....
185
Voted
EPEW
2010
Springer
15 years 7 months ago
Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
Ricardo J. Rodríguez, Jorge Júlvez
JMLR
2008
108views more  JMLR 2008»
15 years 6 months ago
A Recursive Method for Structural Learning of Directed Acyclic Graphs
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
Xianchao Xie, Zhi Geng