Sciweavers

1346 search results - page 100 / 270
» On the number of rectangular partitions
Sort
View
DMTCS
2008
80views Mathematics» more  DMTCS 2008»
14 years 8 months ago
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words
Recently, Kitaev and Remmel [8] refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. Results in [8] were extende...
Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel
IS
2007
14 years 9 months ago
Mining association rules in very large clustered domains
Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
Alexandros Nanopoulos, Apostolos N. Papadopoulos, ...
CSDA
2007
264views more  CSDA 2007»
14 years 10 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 10 months ago
Relaxation-based coarsening and multiscale graph organization
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Dorit Ron, Ilya Safro, Achi Brandt
CORR
2002
Springer
93views Education» more  CORR 2002»
14 years 9 months ago
On the Reflexivity of Point Sets
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
Esther M. Arkin, Sándor P. Fekete, Ferran H...