Sciweavers

1632 search results - page 9 / 327
» Topological Analysis of Refinement
Sort
View
TVCG
2012
203views Hardware» more  TVCG 2012»
13 years 16 days ago
Morse Set Classification and Hierarchical Refinement Using Conley Index
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
Guoning Chen, Qingqing Deng, Andrzej Szymczak, Rob...
BMCBI
2007
150views more  BMCBI 2007»
14 years 10 months ago
Refining intra-protein contact prediction by graph analysis
Background: Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific con...
Milana Frenkel-Morgenstern, Rachel Magid, Eran Eya...
DLOG
2008
15 years 13 days ago
Ontology Refinement through Role Assertion Analysis: Example in Pharmacogenomics
We propose an approach for extending domain knowledge represented in DL ontology by using knowledge extraction methods on ontology assertions. Concept and role assertions are extra...
Adrien Coulet, Malika Smaïl-Tabbone, Amedeo N...
DAC
2006
ACM
15 years 1 months ago
Refined statistical static timing analysis through
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
Benjamin N. Lee, Li-C. Wang, Magdy S. Abadir
EJC
2010
14 years 10 months ago
Rank-width and tree-width of H-minor-free graphs
We prove that for any fixed r 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the...
Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos