Sciweavers

2131 search results - page 16 / 427
» A computational approximation to the AIXI model
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
RECOMB
2004
Springer
14 years 7 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...
ADC
2006
Springer
136views Database» more  ADC 2006»
14 years 1 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
QUESTA
2007
91views more  QUESTA 2007»
13 years 7 months ago
Iterative approximation of k -limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
M. van Vuuren, Erik M. M. Winands
FOCS
2008
IEEE
14 years 2 months ago
Sketching and Streaming Entropy via Approximation Theory
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
Nicholas J. A. Harvey, Jelani Nelson, Krzysztof On...