Sciweavers

1578 search results - page 122 / 316
» Algorithmic randomness of continuous functions
Sort
View
NIPS
2007
14 years 11 months ago
Gaussian Process Models for Link Analysis and Transfer Learning
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...
Kai Yu, Wei Chu
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 4 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
CSDA
2006
71views more  CSDA 2006»
14 years 10 months ago
Practical representations of incomplete probabilistic knowledge
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
Cédric Baudrit, Didier Dubois
ICDCSW
2011
IEEE
13 years 9 months ago
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
—Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These “knees” t...
Ville Satopaa, Jeannie R. Albrecht, David Irwin, B...
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 3 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis