2520 search results - page 203 / 504 » The complexity of approximating entropy |
138
click to vote
ALGORITHMICA
2004
15 years 5 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
140
click to vote
CN
2002
15 years 5 months ago
2002
We present a model for soft handoff in wireless cellular networks. In such networks, due to overlapping cells, handoffs are not instantaneous and multiple channels may be occupied...
183
click to vote
DAM
2011
15 years 26 days ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
150
click to vote
IACR
2011
14 years 5 months ago
2011
Linear cryptanalysis, along with differential cryptanalysis, is an important tool to evaluate the security of block ciphers. This work introduces a novel extension of linear crypt...
278
click to vote
ICLP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...