Sciweavers

9405 search results - page 1012 / 1881
» Computing a Model of Set Theory
Sort
View
POPL
2004
ACM
16 years 8 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
16 years 5 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
HICSS
2010
IEEE
171views Biometrics» more  HICSS 2010»
16 years 2 months ago
Developing Reliable Measures of Privacy Management within Social Networking Sites
Social networking sites and other examples of online social spaces have greatly expanded their members’ opportunities for self expression and social interaction, while creating ...
Catherine Dwyer, Starr Roxanne Hiltz, Marshall Sco...
DLOG
2008
15 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
AAAI
1994
15 years 9 months ago
Heuristic Harvesting of Information for Case-Based Argument
The BankXX system models the process of perusing and gathering information for argument as a heuristic best-first search for relevant cases, theories, and other domain-specific in...
Edwina L. Rissland, David B. Skalak, M. Timur Frie...
« Prev « First page 1012 / 1881 Last » Next »