Sciweavers

5344 search results - page 132 / 1069
» Privacy-Preserving Set Operations
Sort
View
LICS
2007
IEEE
15 years 9 months ago
Tractability and learnability arising from algebras with few subpowers
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...
90
Voted
FUIN
2006
63views more  FUIN 2006»
15 years 2 months ago
Interpreted Trajectories
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
Michael Domaratzki, Grzegorz Rozenberg, Kai Saloma...
115
Voted
COMPUTING
2004
87views more  COMPUTING 2004»
15 years 2 months ago
The Generalized Quantum Database Search Algorithm
In this paper we present a generalized description of the Grover operator, employed in a quantum database search algorithm. We will discuss the relation between the original and ge...
Sándor Imre, Ferenc Balázs
PODS
2005
ACM
86views Database» more  PODS 2005»
16 years 2 months ago
Multi-structural databases
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasm...
147
Voted
FOSSACS
2007
Springer
15 years 6 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...