Sciweavers

6251 search results - page 226 / 1251
» Randomness, Computability, and Density
Sort
View
DCC
2010
IEEE
15 years 11 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
ICPR
2008
IEEE
15 years 11 months ago
Probabilistic clustering by random swap algorithm
:H IRUPXODWH SUREDELOLVWLF FOXVWHULQJ PHWKRG EDVHG RQ D VHTXHQFH RI UDQGRP VZDSV RI FOXVWHU FHQWURLGV :H VKRZ WKDW WKH DOJRULWKP KDV OLQHDU GHSHQGHQF\ RQ WKH QXPEHU RI GDWD YHFWRU...
Pasi Fränti, Olli Virmajoki, Ville Hautam&aum...
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
15 years 10 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
FOCS
1990
IEEE
15 years 8 months ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
FTDCS
2004
IEEE
15 years 8 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller