Sciweavers

1099 search results - page 10 / 220
» String Transformation Learning
Sort
View
MT
2007
120views more  MT 2007»
13 years 7 months ago
Capturing practical natural language transformations
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
Kevin Knight
FOCS
1990
IEEE
13 years 11 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
WSDM
2010
ACM
204views Data Mining» more  WSDM 2010»
14 years 2 months ago
Learning URL patterns for webpage de-duplication
Presence of duplicate documents in the World Wide Web adversely affects crawling, indexing and relevance, which are the core building blocks of web search. In this paper, we pres...
Hema Swetha Koppula, Krishna P. Leela, Amit Agarwa...
ASIACRYPT
2010
Springer
13 years 5 months ago
Efficient String-Commitment from Weak Bit-Commitment
We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational setti...
Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Ya...