Sciweavers

1683 search results - page 255 / 337
» Natural Language Processing (almost) from Scratch
Sort
View
JCT
2011
90views more  JCT 2011»
14 years 5 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
CCS
2009
ACM
15 years 4 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...
SIGIR
2003
ACM
15 years 3 months ago
Automatic image annotation and retrieval using cross-media relevance models
Libraries have traditionally used manual image annotation for indexing and then later retrieving their image collections. However, manual image annotation is an expensive and labo...
Jiwoon Jeon, Victor Lavrenko, R. Manmatha
CLEF
2008
Springer
14 years 11 months ago
ParaMor and Morpho Challenge 2008
ParaMor, our unsupervised morphology induction system performed well at Morpho Challenge 2008. When ParaMor's morphological analyses, which specialize at identifying inflecti...
Christian Monson, Jaime G. Carbonell, Alon Lavie, ...
CORR
1998
Springer
96views Education» more  CORR 1998»
14 years 9 months ago
Similarity-Based Models of Word Cooccurrence Probabilities
Abstract. In many applications of natural language processing (NLP) it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may ne...
Ido Dagan, Lillian Lee, Fernando C. N. Pereira