Sciweavers

6833 search results - page 142 / 1367
» Some two-character sets
Sort
View
DSS
2002
231views more  DSS 2002»
15 years 4 months ago
Computational aspects of the FLBC framework
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
Aspassia Daskalopulu, Marek J. Sergot
AI
2011
Springer
14 years 8 months ago
Learning Dialogue POMDP Models from Data
In this paper, we learn the components of dialogue POMDP models from data. In particular, we learn the states, observations, as well as transition and observation functions based o...
Hamid R. Chinaei, Brahim Chaib-draa
SIGIR
2006
ACM
15 years 10 months ago
Bias and the limits of pooling
Modern retrieval test collections are built through a process called pooling in which only a sample of the entire document set is judged for each topic. The idea behind pooling is...
Chris Buckley, Darrin Dimmick, Ian Soboroff, Ellen...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 9 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
ICPR
2008
IEEE
15 years 10 months ago
On the selection of base prototypes for LAESA and TLAESA classifiers
—The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is l...
Selene Hernández-Rodríguez, Jos&eacu...