2465 search results - page 444 / 493 » Automata on Linear Orderings |
270
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
215
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
209
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
119
click to vote
TCC
2010
Springer
16 years 1 months ago
2010
Springer
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...
132
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...