Sciweavers

496 search results - page 26 / 100
» Machine models and lower bounds for query processing
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
ALT
2008
Springer
14 years 4 months ago
Optimally Learning Social Networks with Activations and Suppressions
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
Dana Angluin, James Aspnes, Lev Reyzin
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
COLT
2004
Springer
13 years 11 months ago
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
13 years 7 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...