Sciweavers

344 search results - page 61 / 69
» The Santa Claus problem
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Witnesses for non-satisfiability of dense random 3CNF formulas
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
Uriel Feige, Jeong Han Kim, Eran Ofek
DLOG
2007
14 years 4 days ago
Expressing DL-Lite Ontologies with Controlled English
In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expres...
Raffaella Bernardi, Diego Calvanese, Camilo Thorne
ECIS
2003
13 years 11 months ago
Using online services in untrusted environments: a privacy-preserving architecture
While online service providers are sometimes accused of forwarding identifying customer information as name and address to untrusted third parties, comparatively little attention ...
Claus Boyens, Oliver Günther
SSWMC
2004
13 years 11 months ago
Security for biometric data
Biometric authentication, i.e. verifying the claimed identity of a person based on physiological characteristics or behavioral traits, has the potential to contribute to both priv...
Claus Vielhauer, Ton Kalker
AAAI
1993
13 years 11 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk