Sciweavers

2883 search results - page 280 / 577
» Algorithms for merged indexes
Sort
View
IAJIT
2008
115views more  IAJIT 2008»
15 years 6 months ago
Optimal Fuzzy Clustering in Overlapping Clusters
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...
Ouafae Ammor, Abdelmounim Lachkar, Khadija Slaoui,...
PRL
2006
139views more  PRL 2006»
15 years 5 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
WWW
2009
ACM
16 years 6 months ago
Estimating web site readability using content extraction
Nowadays, information is primarily searched on the WWW. From a user perspective, the readability is an important criterion for measuring the accessibility and thereby the quality ...
Thomas Gottron, Ludger Martin
SPIRE
2001
Springer
15 years 10 months ago
Adding Security to Compressed Information Retrieval Systems
Word-based Huffman coding has widespread use in information retrieval systems. Besides its compressing power, it also enables the implementation of both indexing and searching sch...
Ruy Luiz Milidiú, C. Gomes de Mello, J. Fer...
WADS
2001
Springer
106views Algorithms» more  WADS 2001»
15 years 10 months ago
Succinct Dynamic Data Structures
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao