Sciweavers

1763 search results - page 233 / 353
» Dependent random choice
Sort
View
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 1 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
14 years 1 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
VISUALIZATION
2000
IEEE
14 years 13 days ago
A flow-guided streamline seeding strategy
This paper presents a seed placement strategy for streamlines based on flow features in the dataset. The primary goal of our seeding strategy is to capture flow patterns in the ...
Vivek Verma, David T. Kao, Alex Pang
COCOON
1998
Springer
14 years 9 days ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer
JOBIM
2000
13 years 11 months ago
Can We Have Confidence in a Tree Representation?
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...
Alain Guénoche, Henri Garreta