Sciweavers

4488 search results - page 283 / 898
» Properties of NP-Complete Sets
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
PKDD
1999
Springer
130views Data Mining» more  PKDD 1999»
15 years 11 months ago
OPTICS-OF: Identifying Local Outliers
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
LOPSTR
1994
Springer
15 years 11 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
FOCS
1992
IEEE
15 years 11 months ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
VLDB
1992
ACM
101views Database» more  VLDB 1992»
15 years 11 months ago
Proclamation-Based Model for Cooperating Transactions
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend ...
H. V. Jagadish, Oded Shmueli