Sciweavers

340 search results - page 65 / 68
» Clustering with Lower Bound on Similarity
Sort
View
PODC
2005
ACM
14 years 4 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
DATAMINE
2007
135views more  DATAMINE 2007»
13 years 10 months ago
Experiencing SAX: a novel symbolic representation of time series
Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researc...
Jessica Lin, Eamonn J. Keogh, Li Wei, Stefano Lona...
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 5 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
BMCBI
2008
132views more  BMCBI 2008»
13 years 11 months ago
SCOWLP classification: Structural comparison and analysis of protein binding regions
Background: Detailed information about protein interactions is critical for our understanding of the principles governing protein recognition mechanisms. The structures of many pr...
Joan Teyra, Maciej Paszkowski-Rogacz, Gerd Anders,...
BC
1998
96views more  BC 1998»
13 years 10 months ago
Evidence of phase transitions in heart period dynamics
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
Henrik Bettermann, Peter Van Leeuwen