Sciweavers

2208 search results - page 217 / 442
» On Issues of Instance Selection
Sort
View
FOIS
2006
15 years 5 months ago
Modular Ontology Design Using Canonical Building Blocks in the Biochemistry Domain
The field of BioInformatics has become a major venue for the development and application of computational ontologies. Ranging from controlled vocabularies to annotation of experim...
Christopher J. Thomas, Amit P. Sheth, William S. Y...
BMCBI
2006
92views more  BMCBI 2006»
15 years 4 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...
134
Voted
AMW
2009
15 years 2 months ago
Schema Design for Uncertain Databases
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
15 years 10 months ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 4 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...