Sciweavers

5592 search results - page 12 / 1119
» On Random Betweenness Constraints
Sort
View
APPROX
2008
Springer
91views Algorithms» more  APPROX 2008»
13 years 12 months ago
Improved Separations between Nondeterministic and Randomized Multiparty Communication
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
Matei David, Toniann Pitassi, Emanuele Viola
BMCBI
2006
141views more  BMCBI 2006»
13 years 10 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
ICMLA
2004
13 years 11 months ago
RAIN: data clustering using randomized interactions between data points
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
Jonatan Gómez, Olfa Nasraoui, Elizabeth Leo...