Sciweavers

1007 search results - page 91 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
COLING
2010
14 years 9 months ago
Fast-Champollion: A Fast and Robust Sentence Alignment Algorithm
Sentence-level aligned parallel texts are important resources for a number of natural language processing (NLP) tasks and applications such as statistical machine translation and ...
Peng Li, Maosong Sun, Ping Xue
CORR
2010
Springer
201views Education» more  CORR 2010»
15 years 8 days ago
Online Advertisement, Optimization and Stochastic Networks
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
R. Srikant
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
15 years 6 months ago
The parallel Nash Memory for asymmetric games
Coevolutionary algorithms search for test cases as part of the search process. The resulting adaptive evaluation function takes away the need to define a fixed evaluation function...
Frans A. Oliehoek, Edwin D. de Jong, Nikos A. Vlas...
SAC
2009
ACM
15 years 9 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke
DEBU
2000
147views more  DEBU 2000»
15 years 2 months ago
XJoin: A Reactively-Scheduled Pipelined Join Operator
Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imb...
Tolga Urhan, Michael J. Franklin