Sciweavers

1695 search results - page 127 / 339
» Linear, Polynomial or Exponential
Sort
View
216
Voted
CDB
1997
Springer
85views Database» more  CDB 1997»
15 years 8 months ago
On Expressing Topological Connectivity in Spatial Datalog
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
Bart Kuijpers, Marc Smits
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 8 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
15 years 6 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
145
Voted
SIGMOD
1998
ACM
93views Database» more  SIGMOD 1998»
15 years 8 months ago
Efficiently Mining Long Patterns from Databases
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
Roberto J. Bayardo Jr.
JELIA
1998
Springer
15 years 8 months ago
A Matrix Characterization for MELL
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic with exponentials. In the process we elaborate a methodology for proving mat...
Heiko Mantel, Christoph Kreitz