Sciweavers

14518 search results - page 120 / 2904
» Two Problems for Sophistication
Sort
View
WSC
2007
14 years 18 days ago
Composability and component-based discrete event simulation
This work presents a framework and a Graphical User Interface, Viskit, for the creation and analysis of component-based Discrete Event Simulation models. Two primary elements of t...
Arnold H. Buss, Curtis L. Blais
LREC
2008
89views Education» more  LREC 2008»
13 years 11 months ago
Development and Alignment of a Domain-Specific Ontology for Question Answering
With the appearance of Semantic Web technologies, it becomes possible to develop novel, sophisticated question answering systems, where ontologies are usually used as the core kno...
Shiyan Ou, Viktor Pekar, Constantin Orasan, Christ...
NIPS
2004
13 years 11 months ago
Synchronization of neural networks by mutual learning and its application to cryptography
Two neural networks that are trained on their mutual output synchronize to an identical time dependant weight vector. This novel phenomenon can be used for creation of a secure cr...
Einat Klein, Rachel Mislovaty, Ido Kanter, Andreas...
NAACL
2003
13 years 11 months ago
Sentence Level Discourse Parsing using Syntactic and Lexical Information
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
Radu Soricut, Daniel Marcu
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
13 years 11 months ago
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
David Eppstein