Sciweavers

4972 search results - page 769 / 995
» Ranking on graph data
Sort
View
JMLR
2010
149views more  JMLR 2010»
15 years 1 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 10 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
NAR
2011
205views Computer Vision» more  NAR 2011»
14 years 9 months ago
The BRENDA Tissue Ontology (BTO): the first all-integrating ontology of all organisms for enzyme sources
BTO, the BRENDA Tissue Ontology (http://www .BTO.brenda-enzymes.org) represents a comprehensive structured encyclopedia of tissue terms. The project started in 2003 to create a co...
Marion Gremse, Antje Chang, Ida Schomburg, Andreas...
SIGMETRICS
2011
ACM
139views Hardware» more  SIGMETRICS 2011»
14 years 9 months ago
Slick packets
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
Giang T. K. Nguyen, Rachit Agarwal, Junda Liu, Mat...
BMCBI
2010
214views more  BMCBI 2010»
15 years 6 months ago
AutoSOME: a clustering method for identifying gene expression modules without prior knowledge of cluster number
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
Aaron M. Newman, James B. Cooper