2079 search results - page 259 / 416 » Universality of random graphs |
115
click to vote
FOCS
1990
IEEE
15 years 8 months ago
1990
IEEE
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
114
click to vote
JEI
2006
15 years 4 months ago
2006
Abstract. We investigate the performance of state of the art universal steganalyzers proposed in the literature. These universal steganalyzers are tested against a number of well-k...
122
Voted
ORL
1998
15 years 4 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
168
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
130
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...