Sciweavers

109 search results - page 4 / 22
» Are Very Large N-Best Lists Useful for SMT
Sort
View
DMIN
2009
136views Data Mining» more  DMIN 2009»
13 years 3 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 6 months ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney
LREC
2008
130views Education» more  LREC 2008»
13 years 7 months ago
Detecting Co-Derivative Documents in Large Text Collections
We have analyzed the SPEX algorithm by Bernstein and Zobel (2004) for detecting co-derivative documents using duplicate n-grams. Although we totally agree with the claim that not ...
Jan Pomikálek, Pavel Rychlý
IPPS
2009
IEEE
14 years 20 days ago
Handling OS jitter on multicore multithreaded systems
Various studies have shown that OS jitter can degrade parallel program performance considerably at large processor counts. Most sources of system jitter fall broadly into 5 catego...
Pradipta De, Vijay Mann, Umang Mittaly
EUROCRYPT
2008
Springer
13 years 7 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky