Sciweavers

1066 search results - page 60 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
FCT
2007
Springer
15 years 3 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
PSD
2004
Springer
132views Database» more  PSD 2004»
15 years 3 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
14 years 9 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
ISVC
2007
Springer
15 years 3 months ago
Learning to Recognize Complex Actions Using Conditional Random Fields
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...
Christopher I. Connolly
COMPUTER
1999
95views more  COMPUTER 1999»
14 years 9 months ago
Wide-Area Computing: Resource Sharing on a Large Scale
abstract over a complex set of resources and provide a high-level way to share and manage them over the network. To be effective, such a system must address the challenges posed by...
Andrew S. Grimshaw, Adam Ferrari, Frederick Knabe,...