Sciweavers

982 search results - page 148 / 197
» Reduction Relations for Agent Models
Sort
View
AMAST
2008
Springer
15 years 2 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
COLING
2010
14 years 7 months ago
Improving Name Origin Recognition with Context Features and Unlabelled Data
We demonstrate the use of context features, namely, names of places, and unlabelled data for the detection of personal name language of origin. While some early work used either r...
Vladimir Pervouchine, Min Zhang, Ming Liu, Haizhou...
166
Voted
TIP
2010
145views more  TIP 2010»
14 years 7 months ago
Joint Manifolds for Data Fusion
The emergence of low-cost sensing architectures for diverse modalities has made it possible to deploy sensor networks that capture a single event from a large number of vantage po...
Mark A. Davenport, Chinmay Hegde, Marco F. Duarte,...
119
Voted
AAAI
2004
15 years 2 months ago
Interactive Information Extraction with Constrained Conditional Random Fields
Information Extraction methods can be used to automatically "fill-in" database forms from unstructured data such as Web documents or email. State-of-the-art methods have...
Trausti T. Kristjansson, Aron Culotta, Paul A. Vio...
117
Voted
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
15 years 5 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup