Sciweavers

9842 search results - page 1278 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICML
2001
IEEE
16 years 8 months ago
Round Robin Rule Learning
In this paper, we discuss a technique for handling multi-class problems with binary classifiers, namely to learn one classifier for each pair of classes. Although this idea is kno...
Johannes Fürnkranz
WWW
2007
ACM
16 years 8 months ago
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...
Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg
WWW
2005
ACM
16 years 8 months ago
Boosting SVM classifiers by ensemble
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...
Yan-Shi Dong, Ke-Song Han
ICLP
2009
Springer
16 years 8 months ago
Metabolic Network Expansion with Answer Set Programming
Abstract. We propose a qualitative approach to elaborating the biosynthetic capacities of metabolic networks. In fact, large-scale metabolic networks as well as measured datasets s...
Torsten Schaub, Sven Thiele
ASPLOS
2009
ACM
16 years 8 months ago
GPU acceleration of a production molecular docking code
Abstract: Modeling the interactions of biological molecules, or docking, is critical to both understanding basic life processes and to designing new drugs. Here we describe the GPU...
Bharat Sukhwani, Martin C. Herbordt
« Prev « First page 1278 / 1969 Last » Next »