Sciweavers

656 search results - page 118 / 132
» Marrying Words and Trees
Sort
View
RFIDSEC
2010
14 years 10 months ago
The Poulidor Distance-Bounding Protocol
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
Rolando Trujillo-Rasua, Benjamin Martin 0002, Gild...
SCP
2010
154views more  SCP 2010»
14 years 10 months ago
An algebraic foundation for automatic feature-based program synthesis
Feature-Oriented Software Development provides a multitude of formalisms, methods, languages, and tools for building variable, customizable, and extensible software. Along differe...
Sven Apel, Christian Lengauer, Bernhard Mölle...
CIKM
2010
Springer
14 years 9 months ago
Index structures for efficiently searching natural language text
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...
Pirooz Chubak, Davood Rafiei
SOFSEM
2010
Springer
14 years 9 months ago
Approximate Structural Consistency
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
Michel de Rougemont, Adrien Vieilleribière
126
Voted
ACL
2009
14 years 9 months ago
Mining Bilingual Data from the Web with Adaptively Learnt Patterns
Mining bilingual data (including bilingual sentences and terms1 ) from the Web can benefit many NLP applications, such as machine translation and cross language information retrie...
Long Jiang, Shiquan Yang, Ming Zhou, Xiaohua Liu, ...