Sciweavers

2104 search results - page 137 / 421
» Sorting with networks of data structures
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 4 months ago
On the Convexity of Latent Social Network Inference
In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, w...
Seth A. Myers, Jure Leskovec
144
Voted
JMLR
2002
102views more  JMLR 2002»
15 years 4 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
124
Voted
BMCBI
2006
118views more  BMCBI 2006»
15 years 4 months ago
Predicting the effect of missense mutations on protein function: analysis with Bayesian networks
Background: A number of methods that use both protein structural and evolutionary information are available to predict the functional consequences of missense mutations. However, ...
Chris J. Needham, James R. Bradford, Andrew J. Bul...
JMLR
2006
103views more  JMLR 2006»
15 years 4 months ago
MinReg: A Scalable Algorithm for Learning Parsimonious Regulatory Networks in Yeast and Mammals
In recent years, there has been a growing interest in applying Bayesian networks and their extensions to reconstruct regulatory networks from gene expression data. Since the gene ...
Dana Pe'er, Amos Tanay, Aviv Regev
INFOCOM
2010
IEEE
15 years 3 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...