Sciweavers

1457 search results - page 72 / 292
» On the Uniform Distribution of Strings
Sort
View
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
15 years 10 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
ISCI
2010
110views more  ISCI 2010»
15 years 4 months ago
Weighted finite automata over strong bimonoids
: We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need t...
Manfred Droste, Torsten Stüber, Heiko Vogler
CORR
2011
Springer
172views Education» more  CORR 2011»
15 years 1 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 6 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra
FC
2001
Springer
125views Cryptology» more  FC 2001»
15 years 10 months ago
(M+1)st-Price Auction Protocol
Abstract. This paper presents a new protocol for M + 1st-price auction, a style of auction in which the highest M bidders win and pay a uniform price, determined by the (M + 1)st p...
Hiroaki Kikuchi