3267 search results - page 271 / 654 » Generalized quasirandom graphs |
218
click to vote
IWCMC
2009
ACM
15 years 11 months ago
2009
ACM
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
199
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
217
click to vote
AC
2000
Springer
15 years 11 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
173
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
191
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...