Sciweavers

702 search results - page 4 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
CISS
2008
IEEE
14 years 25 days ago
Identifying sufficient statistics in information networks
Abstract –Given a network targeting information transmission, this paper considers the problem of identifying a set of edges or nodes whose transmission is sufficient to determin...
Huaiyu Dai, Husheng Li
DM
2002
116views more  DM 2002»
13 years 6 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
BMCBI
2007
140views more  BMCBI 2007»
13 years 6 months ago
Prediction potential of candidate biomarker sets identified and validated on gene expression data from multiple datasets
Background: Independently derived expression profiles of the same biological condition often have few genes in common. In this study, we created populations of expression profiles...
Michael Gormley, William Dampier, Adam Ertel, Bilg...
APVIS
2001
13 years 7 months ago
Information Visualisation using Composable Layouts and Visual Sets
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....
Tim Pattison, Rudi Vernik, Matthew Phillips
ACL
2010
13 years 4 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev