Sciweavers

15073 search results - page 2616 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SEMWEB
2009
Springer
15 years 9 months ago
Semantic Web Service Composition in Social Environments
This paper describes how to generate compositions of semantic Web services using social trust information from user ratings of the services. We present a taxonomy of features, suc...
Ugur Kuter, Jennifer Golbeck
WABI
2001
Springer
110views Bioinformatics» more  WABI 2001»
15 years 9 months ago
Boosting EM for Radiation Hybrid and Genetic Mapping
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating physical distances between them. It nicely complements...
Thomas Schiex, Patrick Chabrier, Martin Bouchez, D...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 9 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
COLT
1999
Springer
15 years 9 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 9 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
« Prev « First page 2616 / 3015 Last » Next »