Sciweavers

421 search results - page 37 / 85
» String Distances and Uniformities
Sort
View
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
15 years 10 months ago
Scalable Load-Distance Balancing
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
Edward Bortnikov, Israel Cidon, Idit Keidar
ADC
2003
Springer
123views Database» more  ADC 2003»
15 years 9 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
123
Voted
ECCC
2002
90views more  ECCC 2002»
15 years 4 months ago
Almost k-wise independence versus k-wise independence
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
Noga Alon, Oded Goldreich, Yishay Mansour
ECAI
2006
Springer
15 years 7 months ago
Unified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
Jussi Rintanen
CSDA
2007
115views more  CSDA 2007»
15 years 4 months ago
Arbitrarily shaped multiple spatial cluster detection for case event data
An original method is proposed for spatial cluster detection of case event data. A selection order and the distance from the nearest neighbour are attributed to each point, once p...
Christophe Dematteï, Nicolas Molinari, Jean-P...