Sciweavers

701 search results - page 123 / 141
» Self Bounding Learning Algorithms
Sort
View
JMLR
2012
11 years 10 months ago
A Stick-Breaking Likelihood for Categorical Data Analysis with Latent Gaussian Models
The development of accurate models and efficient algorithms for the analysis of multivariate categorical data are important and longstanding problems in machine learning and compu...
Mohammad Emtiyaz Khan, Shakir Mohamed, Benjamin M....
NDSS
2008
IEEE
14 years 1 months ago
Limits of Learning-based Signature Generation with Adversaries
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
Shobha Venkataraman, Avrim Blum, Dawn Song
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 7 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 9 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein