Sciweavers

2503 search results - page 388 / 501
» A study of 3-arc graphs
Sort
View
MP
2011
13 years 5 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
14 years 5 days ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
BMCBI
2008
83views more  BMCBI 2008»
13 years 10 months ago
Models of deletion for visualizing bacterial variation: an application to tuberculosis spoligotypes
Background: Molecular typing methods are commonly used to study genetic relationships among bacterial isolates. Many of these methods have become standardized and produce portable...
Josephine F. Reyes, Andrew R. Francis, Mark M. Tan...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 10 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
AI
2002
Springer
13 years 10 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman