Sciweavers

11160 search results - page 417 / 2232
» Incompleteness in a General Setting
Sort
View
EMNLP
2008
15 years 8 months ago
A comparison of Bayesian estimators for unsupervised Hidden Markov Model POS taggers
There is growing interest in applying Bayesian techniques to NLP problems. There are a number of different estimators for Bayesian models, and it is useful to know what kinds of t...
Jianfeng Gao, Mark Johnson
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 7 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
ICPR
2006
IEEE
16 years 8 months ago
Dissimilarity-based classification for vectorial representations
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
Elzbieta Pekalska, Robert P. W. Duin
ICML
2001
IEEE
16 years 7 months ago
Inducing Partially-Defined Instances with Evolutionary Algorithms
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instance...
Josep Maria Garrell i Guiu, Xavier Llorà
ESORICS
2009
Springer
16 years 7 months ago
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this...
Mihhail Aizatulin, Henning Schnoor, Thomas Wilke