Sciweavers

395 search results - page 38 / 79
» Model-based overlapping clustering
Sort
View
GSN
2009
Springer
149views Sensor Networks» more  GSN 2009»
14 years 3 months ago
Spatially-Localized Compressed Sensing and Routing in Multi-hop Sensor Networks
We propose energy-efficient compressed sensing for wireless sensor networks using spatially-localized sparse projections. To keep the transmission cost for each measurement low, we...
Sungwon Lee, Sundeep Pattem, Maheswaran Sathiamoor...
UAI
2008
14 years 8 days ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
DAM
2006
86views more  DAM 2006»
13 years 11 months ago
Sub-dominant theory in numerical taxonomy
Sub-dominant theory provides efficient tools for clustering. However it classically works only for ultrametrics and ad hoc extensions like Jardine and Sibson's 2ultrametrics....
François Brucker
CLUSTER
2011
IEEE
12 years 10 months ago
Investigating Scenario-Conscious Asynchronous Rendezvous over RDMA
— In this paper, we propose a light-weight asynchronous message progression mechanism for large message transfers in Message Passing Interface (MPI) Rendezvous protocol that is s...
Judicael A. Zounmevo, Ahmad Afsahi
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 8 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...