Sciweavers

363 search results - page 57 / 73
» Getting answers to natural language questions on the Web
Sort
View
AMAST
2004
Springer
15 years 4 months ago
Linear Temporal Logic and Z Refinement
Since Z, being a state-based language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also...
John Derrick, Graeme Smith
98
Voted
JMLR
2010
106views more  JMLR 2010»
14 years 7 months ago
Why Does Unsupervised Pre-training Help Deep Learning?
Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of auto-encoder variants, with impressive results obtai...
Dumitru Erhan, Yoshua Bengio, Aaron C. Courville, ...
92
Voted
WEBDB
2004
Springer
143views Database» more  WEBDB 2004»
15 years 5 months ago
DTDs versus XML Schema: A Practical Study
Among the various proposals answering the shortcomings of Document Type Definitions (DTDs), XML Schema is the most widely used. Although DTDs and XML Schema Defintions (XSDs) di...
Geert Jan Bex, Frank Neven, Jan Van den Bussche
93
Voted
SIGCSE
2004
ACM
140views Education» more  SIGCSE 2004»
15 years 5 months ago
CFX: finding just the right examples for CS1
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
Dale Reed, Sam John, Ryan Aviles, Feihong Hsu
LATINCRYPT
2010
14 years 11 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...