1951 search results - page 191 / 391 » An algorithm for improving graph partitions |
135
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
193
click to vote
AAAI
2012
13 years 8 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
147
click to vote
INFOCOM
2009
IEEE
16 years 21 days ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
128
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
We present an Outlier Detection using Indegree Number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance -based method are also propos...
153
click to vote
ICPR
2008
IEEE
16 years 14 days ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...