109 search results - page 21 / 22 » Are Very Large N-Best Lists Useful for SMT |
VLDB
2001
ACM
13 years 10 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
ECRIME
2007
13 years 9 months ago
2007
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
INFOCOM
2009
IEEE
14 years 7 days ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
Problems resulting from the management of shared, distributed knowledge has led to ontologies being employed as a solution, in order to effectively integrate information across a...