Sciweavers

526 search results - page 1 / 106
» Increments of Random Partitions
Sort
View
CPC
2006
92views more  CPC 2006»
13 years 4 months ago
Increments of Random Partitions
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...
Serban Nacu
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 2 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
FPL
2006
Springer
103views Hardware» more  FPL 2006»
13 years 8 months ago
Modular Partitioning for Incremental Compilation
This paper presents an automated partitioning strategy to divide a design into a set of partitions based on design hierarchy information. While the primary objective is to use the...
Mehrdad Eslami Dehkordi, Stephen Dean Brown, Terry...

Publication
252views
13 years 8 months ago
Context models on sequences of covers
We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approac...
Christos Dimitrakakis
ICPR
2008
IEEE
13 years 11 months ago
Incremental nested partition method
In this paper, we introduce an incremental nested partition algorithm for finding the inner structuralization of dynamic datasets. Here we use three partition criteria that allow...
Jyrko Correa-Morris, José Ruiz-Shulcloper, ...