Sciweavers

3081 search results - page 480 / 617
» A Formal Ontology of Properties
Sort
View
IDA
2005
Springer
15 years 12 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
IFIP
2005
Springer
15 years 12 months ago
Probable Innocence Revisited
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
ISPEC
2005
Springer
15 years 12 months ago
Token-Controlled Public Key Encryption
Token-controlled public key encryption (TCPKE) schemes, introduced in [1], offer many possibilities of application in financial or legal scenarios. Roughly speaking, in a TCPKE s...
Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
15 years 12 months ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan
FMCAD
2004
Springer
15 years 12 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi