Sciweavers

1403 search results - page 43 / 281
» About Approximations of Exponentials
Sort
View
121
Voted
IJCAI
2001
15 years 2 months ago
Approximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
Hanna Pasula, Stuart J. Russell
SEC
1996
15 years 2 months ago
Intention modelling: approximating computer user intentions for detection and prediction of intrusions
This paper introduces and describes an innovative modelling approach which utilises models that are synthesised through approximate calculations of user actions and extensive repr...
Thomas Spyrou, John Darzentas
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 4 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
119
Voted
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
15 years 10 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
69
Voted
NIPS
2003
15 years 2 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