Sciweavers

3136 search results - page 124 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
15 years 10 months ago
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
Jesús Cerquides, Ramon López de M&aa...
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 6 months ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 6 months ago
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
The running maximum-minimum (MAX-MIN) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time seri...
Daniel Lemire
ICPR
2008
IEEE
16 years 23 days ago
Dunn's cluster validity index as a contrast measure of VAT images
This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and Dunn’s cluster validity index. We present an analytical comparison in...
Timothy C. Havens, James C. Bezdek, James M. Kelle...
ISPAN
2005
IEEE
15 years 12 months ago
Increasing Sensor Network Lifetime by Identifying and Leveraging Nodes with Excess Energy In Heterogeneous Networks
We propose and evaluate wireless sensor routing algorithms designed to extend the lifetime of a heterogeneous wireless sensor network. The network is heterogeneous in the sensors...
Keith Hellman, Michael Colagrosso