Sciweavers

1887 search results - page 287 / 378
» Clustering with Local Restrictions
Sort
View
NIPS
2003
14 years 11 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
UAI
2003
14 years 11 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
UAI
1998
14 years 11 months ago
Hierarchical Solution of Markov Decision Processes using Macro-actions
tigate the use of temporally abstract actions, or macro-actions, in the solution of Markov decision processes. Unlike current models that combine both primitive actions and macro-...
Milos Hauskrecht, Nicolas Meuleau, Leslie Pack Kae...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 11 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
ISMB
1993
14 years 11 months ago
MultiMap: An Expert System for Automated Genetic Linkage Mapping
Withthe advent of the HumanGenomeProject. the ability to rapidly construct comprehensiveand accuratelinkage mapsbasedongenetic markerdata fromfamily studies is an absolute necessi...
Tara Cox Matise, Mark Perlin, Aravinda Chakravarti