Sciweavers

247 search results - page 6 / 50
» Ideals without CCC
Sort
View
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 2 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
LICS
2008
IEEE
14 years 1 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
ICALP
2007
Springer
13 years 9 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou
IS
2007
13 years 7 months ago
Aldat: A retrospective on a work in progress
level of abstraction which is not only ideally suited for processing data on secondary storage but which also readily absorbs important issues in computational parallelism and in d...
T. H. Merrett
ACL
2012
11 years 9 months ago
Coarse Lexical Semantic Annotation with Supersenses: An Arabic Case Study
“Lightweight” semantic annotation of text calls for a simple representation, ideally without requiring a semantic lexicon to achieve good coverage in the language and domain. ...
Nathan Schneider, Behrang Mohit, Kemal Oflazer, No...