Sciweavers

14165 search results - page 612 / 2833
» The generalized two-server problem
Sort
View
CIKM
2008
Springer
15 years 9 months ago
Exploiting context to detect sensitive information in call center conversations
Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important. In call-centers a lot of customer related sensitive in...
Tanveer A. Faruquie, Sumit Negi, Anup Chalamalla, ...
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
15 years 9 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
EMNLP
2008
15 years 8 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
15 years 8 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
ESANN
2004
15 years 8 months ago
Separability of analytic postnonlinear blind source separation with bounded sources
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...
Fabian J. Theis, Peter Gruber