Sciweavers

3096 search results - page 291 / 620
» Theory and Use of the EM Algorithm
Sort
View
CRYPTO
2000
Springer
124views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Fast Correlation Attacks through Reconstruction of Linear Polynomials
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the out...
Thomas Johansson, Fredrik Jönsson
ATAL
2007
Springer
15 years 10 months ago
Planning and defeasible reasoning
We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to cons...
Diego R. García, Alejandro Javier Garc&iacu...
HICSS
1998
IEEE
97views Biometrics» more  HICSS 1998»
15 years 11 months ago
CAFE: A Conceptual Model for Managing Information in Electronic Mail
The design and implementation of a conceptual model, CAFE (a Categorization Assistant For E-mail), is described. The model supports the organization, searching, and retrieval of i...
Juha Takkinen, Nahid Shahmehri
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
16 years 7 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
COMPGEOM
2006
ACM
16 years 18 days ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...