Sciweavers

702 search results - page 9 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
CORR
2007
Springer
69views Education» more  CORR 2007»
13 years 8 months ago
Lossless Representation of Graphs using Distributions
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
Mireille Boutin, Gregor Kemper
BMCBI
2006
85views more  BMCBI 2006»
13 years 8 months ago
Use of physiological constraints to identify quantitative design principles for gene expression in yeast adaptation to heat shoc
Background: Understanding the relationship between gene expression changes, enzyme activity shifts, and the corresponding physiological adaptive response of organisms to environme...
Ester Vilaprinyó, Rui Alves, Albert Sorriba...
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 24 days ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
BMCBI
2010
277views more  BMCBI 2010»
13 years 8 months ago
PCA2GO: a new multivariate statistics based method to identify highly expressed GO-Terms
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
Marc Bruckskotten, Mario Looso, Franz Cemic, Anne ...
SIGSOFT
2007
ACM
14 years 9 months ago
Using groupings of static analysis alerts to identify files likely to contain field failures
In this paper, we propose a technique for leveraging historical field failure records in conjunction with automated static analysis alerts to determine which alerts or sets of ale...
Mark Sherriff, Sarah Smith Heckman, J. Michael Lak...