1066 search results - page 184 / 214 » Computing Private Set Operations with Linear Complexities |
83
Voted
SOFSEM
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Formal methods based on the mathematical theory of partially ordered sets (i.e., posets) have been used in the database field for the modelling of spatial data since many...
90
Voted
STACS
1994
Springer
15 years 1 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
78
Voted
ACL
2010
14 years 7 months ago
2010
This paper describes a series of experiments to test the hypothesis that the parallel application of multiple NLP tools and the integration of their results improves the correctne...
101
click to vote
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...