Sciweavers

7536 search results - page 1355 / 1508
» Localized Components Analysis
Sort
View
SPAA
1996
ACM
15 years 10 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
FASE
2006
Springer
15 years 10 months ago
Argus: Online Statistical Bug Detection
Statistical debugging is a powerful technique for identifying bugs that do not violate programming rules or program invariants. Previously known statistical debugging techniques ar...
Long Fei, Kyungwoo Lee, Fei Li, Samuel P. Midkiff
CBMS
2001
IEEE
15 years 10 months ago
An Interoperable Data Architecture for Data Exchange in a Biomedical Research Network
Knowledge discovery and data correlation require a unified approach to basic data management. However, achieving such an approach is nearly impossible with hundreds of disparate d...
Daniel J. Crichton, J. Steven Hughes, Gregory J. D...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 10 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
IJCAI
2007
15 years 7 months ago
A Logical Framework for Modularity of Ontologies
Modularity is a key requirement for collaborative ontology engineering and for distributed ontology reuse on the Web. Modern ontology languages, such as OWL, are logic-based, and ...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
« Prev « First page 1355 / 1508 Last » Next »