5056 search results - page 384 / 1012 » Network Coding Theory |
120
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
133
click to vote
AWIC
2005
Springer
15 years 10 months ago
2005
Springer
Query expansion has been extensively studied as a technique for increasing information retrieval performance. However, due to the volume of documents available on the web, many of ...
138
click to vote
EOR
2008
15 years 4 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
155
click to vote
TSMC
2010
14 years 11 months ago
2010
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
227
click to vote
IWANN
2011
Springer
14 years 7 months ago
2011
Springer
In recent years, the increasing interest in fuzzy rough set theory has allowed the definition of novel accurate methods for feature selection. Although their stand-alone applicati...