3268 search results - page 396 / 654 » The hub number of a graph |
188
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
167
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
205
click to vote
COR
2008
15 years 6 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
237
click to vote
ANTSW
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...