5962 search results - page 255 / 1193 » Efficient Clustering for Orders |
176
click to vote
ACSC
2005
IEEE
16 years 10 days ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
144
click to vote
ISPASS
2005
IEEE
16 years 9 days ago
2005
IEEE
In this paper we study the properties of a new packet trace compression method based on clustering of TCP flows. With our proposed method, the compression ratio that we achieve i...
161
click to vote
KES
2005
Springer
16 years 6 days ago
2005
Springer
This paper describes a theoretical approach on data mining, information classifying and a global overview of our OntoExtractor application, concerning the analysis of incoming data...
171
click to vote
ADC
2004
Springer
16 years 3 days ago
2004
Springer
Many spatio-temporal applications involve managing and querying moving objects. In such an environment, predictive spatio-temporal queries become an important query class to be pr...
147
click to vote
ICCS
2003
Springer
15 years 12 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...