1736 search results - page 60 / 348 » The rank-width of Directed Graphs |
134
click to vote
PR
2007
15 years 3 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
124
click to vote
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
138
click to vote
AUSAI
2005
Springer
15 years 9 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
152
click to vote
TC
2010
15 years 2 months ago
2010
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...
136
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Physical wave fields are often described by means of a vector field. Advances in sensor technology enable us to collect an increasing number of measurement at the same location ...