Sciweavers

267 search results - page 29 / 54
» Anti-Ramsey properties of random graphs
Sort
View
ICALP
1992
Springer
15 years 3 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
ICMCS
2005
IEEE
71views Multimedia» more  ICMCS 2005»
15 years 5 months ago
A proposal of butterfly-graph based stream authentication over lossy networks
In this paper, we propose a butterfly-graph based stream authentication scheme for lossy networks where the streaming packets could be lost in both random and burst ways. Due to t...
Zhishou Zhang, Qibin Sun, Wai-Choong Wong
ICASSP
2011
IEEE
14 years 3 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
CORR
2010
Springer
190views Education» more  CORR 2010»
14 years 12 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 12 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj