Sciweavers

4199 search results - page 319 / 840
» Generalizing Data in Natural Language
Sort
View
CCS
2005
ACM
16 years 6 days ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
170
Voted
CTCS
1989
Springer
15 years 10 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
JACM
2010
137views more  JACM 2010»
15 years 5 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
IDEAS
2007
IEEE
118views Database» more  IDEAS 2007»
16 years 29 days ago
A Two Layered Approach for Querying Integrated XML Sources
The problem of data integration (query decomposition, data fragmentation) has been widely studied in literature, but the inherent hierarchical nature of XML data presents problems...
Felipe Victolla Silveira, Carlos A. Heuser
CSR
2007
Springer
16 years 25 days ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen