Sciweavers

205 search results - page 40 / 41
» Testing the Equivalence of Regular Languages
Sort
View
EMNLP
2010
14 years 7 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
ANLP
1994
101views more  ANLP 1994»
14 years 10 months ago
Sublanguage Engineering In The Fog System
FoG currently produces bilingual marine and public weather forecasts at several Canadian weather offices. The system is engineered to reflect "good professional style" a...
Richard I. Kittredge, Eli Goldberg, Myunghee Kim, ...
OTM
2007
Springer
15 years 3 months ago
Translating XPath Queries into SPARQL Queries
Abstract The W3C has developed XPath [3] as a query language for XML data. XPath is embedded in many other languages like XQuery and XSLT. The name of XPath derives from its basic ...
Matthias Droop, Markus Flarer, Jinghua Groppe, Sve...
PLDI
2010
ACM
15 years 2 months ago
Line-up: a complete and automatic linearizability checker
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
Sebastian Burckhardt, Chris Dern, Madanlal Musuvat...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III