Sciweavers

666 search results - page 93 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 4 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
COCOON
2006
Springer
14 years 27 days ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
ACL
2004
13 years 10 months ago
Convolution Kernels with Feature Selection for Natural Language Processing Tasks
Convolution kernels, such as sequence and tree kernels, are advantageous for both the concept and accuracy of many natural language processing (NLP) tasks. Experiments have, howev...
Jun Suzuki, Hideki Isozaki, Eisaku Maeda
BMCBI
2010
110views more  BMCBI 2010»
13 years 9 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou