Sciweavers

4645 search results - page 924 / 929
» Using Information Extraction to Improve Document Retrieval
Sort
View
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 9 months ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
WWW
2003
ACM
14 years 8 months ago
A Presentation Architecture for Individualized Content
A modern approach for generating individualized web-sites is to compose a page out of individual elements, for instance XML-fragments, which is eventually transformed to . If the ...
Alberto González Palomo, Carsten Ullrich, P...
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 7 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
JCDL
2009
ACM
133views Education» more  JCDL 2009»
14 years 1 months ago
Cost and benefit analysis of mediated enterprise search
The utility of an enterprise search system is determined by three key players: the information retrieval (IR) system (the search engine), the enterprise users, and the service pro...
Mingfang Wu, James A. Thom, Andrew Turpin, Ross Wi...
ICML
2006
IEEE
14 years 8 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman