Sciweavers

2137 search results - page 210 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ISBI
2009
IEEE
14 years 4 months ago
Image-Driven Population Analysis Through Mixture Modeling
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...
Mert R. Sabuncu
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
12 years 9 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
JMLR
2008
94views more  JMLR 2008»
13 years 9 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
ACMSE
2006
ACM
14 years 3 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
EURODAC
1995
IEEE
128views VHDL» more  EURODAC 1995»
14 years 27 days ago
Closeness metrics for system-level functional partitioning
An important system design task is the partitioning of system functionality for implementation among multiple system components, including partitions among hardware and software c...
Frank Vahid, Daniel D. Gajski