Sciweavers

7930 search results - page 1198 / 1586
» Greedy in Approximation Algorithms
Sort
View
ASUNAM
2011
IEEE
14 years 6 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
CEC
2011
IEEE
14 years 6 months ago
Trainer selection strategies for coevolving rank predictors
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
Daniel L. Ly, Hod Lipson
GANDC
2011
93views more  GANDC 2011»
14 years 6 months ago
Bayesian spatial modeling and interpolation using copulas
Copulas have attracted much attention in spatial statistics over the past few years. They are used as a flexible alternative to traditional methods for nonGaussian spatial modelin...
Hannes Kazianka, Jürgen Pilz
CORR
2012
Springer
217views Education» more  CORR 2012»
14 years 2 months ago
An Adaptive Mechanism for Accurate Query Answering under Differential Privacy
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...
Chao Li, Gerome Miklau
JMLR
2012
13 years 9 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
« Prev « First page 1198 / 1586 Last » Next »