Sciweavers

738 search results - page 138 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
BALT
2006
15 years 1 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut
JAMIA
2011
68views more  JAMIA 2011»
14 years 16 days ago
A secure protocol for protecting the identity of providers when disclosing data for disease surveillance
Background Providers have been reluctant to disclose patient data for public-health purposes. Even if patient privacy is ensured, the desire to protect provider confidentiality h...
Khaled El Emam, Jun Hu, Jay Mercer, Liam Peyton, M...
81
Voted
ICDCS
2007
IEEE
15 years 4 months ago
LagOver: Latency Gradated Overlays
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as Latency Gradated Ove...
Anwitaman Datta, Ion Stoica, Michael J. Franklin
CCS
2006
ACM
15 years 1 months ago
Beyond separation of duty: an algebra for specifying high-level security policies
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
Ninghui Li, Qihua Wang
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis