Sciweavers

1496 search results - page 242 / 300
» Introducing Speech and Language Processing
Sort
View
IANDC
2011
129views more  IANDC 2011»
14 years 6 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
WWW
2007
ACM
16 years 16 days ago
Hierarchical, perceptron-like learning for ontology-based information extraction
Recent work on ontology-based Information Extraction (IE) has tried to make use of knowledge from the target ontology in order to improve semantic annotation results. However, ver...
Yaoyong Li, Kalina Bontcheva
SIGMOD
2007
ACM
147views Database» more  SIGMOD 2007»
16 years 8 hour ago
Extending relational query optimization to dynamic schemas for information integration in multidatabases
This paper extends relational processing and optimization to the FISQL/FIRA languages for dynamic schema queries over multidatabases. Dynamic schema queries involve the creation a...
Catharine M. Wyss, Felix I. Wyss
SAT
2009
Springer
126views Hardware» more  SAT 2009»
15 years 6 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
ACSAC
2007
IEEE
15 years 6 months ago
Quarantining Untrusted Entities: Dynamic Sandboxing Using LEAP
Jails, Sandboxes and other isolation mechanisms limit the damage from untrusted programs by reducing a process’s privileges to the minimum. Sandboxing is designed to thwart such...
Manigandan Radhakrishnan, Jon A. Solworth