Sciweavers

916 search results - page 45 / 184
» Using redundancies to find errors
Sort
View
WWW
2011
ACM
13 years 6 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
LREC
2008
141views Education» more  LREC 2008»
14 years 12 days ago
All, and only, the Errors: more Complete and Consistent Spelling and OCR-Error Correction Evaluation
Some time in the future, some spelling error correction system will correct all the errors, and only the errors. We need evaluation metrics that will tell us when this has been ac...
Martin Reynaert
EMNLP
2010
13 years 9 months ago
Generating Confusion Sets for Context-Sensitive Error Correction
In this paper, we consider the problem of generating candidate corrections for the task of correcting errors in text. We focus on the task of correcting errors in preposition usag...
Alla Rozovskaya, Dan Roth
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
14 years 2 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
Gunnar Gaubatz, Berk Sunar
ICDAR
2009
IEEE
13 years 8 months ago
Document Content Extraction Using Automatically Discovered Features
We report an automatic feature discovery method that achieves results comparable to a manually chosen, larger feature set on a document image content extraction problem: the locat...
Sui-Yu Wang, Henry S. Baird, Chang An