3068 search results - page 363 / 614 » Clustering with Multiple Graphs |
191
click to vote
ASUNAM
2009
IEEE
16 years 1 months ago
2009
IEEE
A user profile on an online social network is characterized by its profile entries (keywords). In this paper, we study the relationship between semantic similarity of user keywo...
158
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
172
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly ...
179
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
137
click to vote
ISVD
2007
IEEE
16 years 28 days ago
2007
IEEE
We introduce the use of weighted medial graph structures to represent sounds and musical events. Such structures permit the building of hierarchical neighborhood relationships (sy...