1029 search results - page 109 / 206 » Compact representations of ordered sets |
118
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. This paper is centered on the problem of merging (possibly conflicting) information coming from different sources. Though this problem has attracted much attention in pro...
137
click to vote
JAPLL
2006
15 years 2 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
129
click to vote
CADE
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
128
click to vote
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
135
Voted
PODC
2006
ACM
15 years 8 months ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...