Sciweavers

541 search results - page 57 / 109
» Applications of nonstandard analysis in additive number theo...
Sort
View
PODC
2009
ACM
14 years 9 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
DCC
2005
IEEE
14 years 8 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
EDBTW
2010
Springer
14 years 3 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
WSDM
2009
ACM
112views Data Mining» more  WSDM 2009»
14 years 3 months ago
Finding text reuse on the web
With the overwhelming number of reports on similar events originating from different sources on the web, it is often hard, using existing web search paradigms, to find the origi...
Michael Bendersky, W. Bruce Croft
ETT
2006
88views Education» more  ETT 2006»
13 years 8 months ago
On the outage behaviour of large DS-CDMA systems with LMMSE detection
Abstract-- The outage behaviour of the single cell DSCDMA uplink is investigated for flat Rayleigh fading channels. Goal of the work is to find an analytical way for the optimisati...
Oliver Prätor, Gerhard Fettweis