473 search results - page 38 / 95 » Computing excluded minors |
78
Voted
ICWS
2009
IEEE
15 years 9 months ago
2009
IEEE
There are a large number of websites serving valuable content that can be used by higher-level applications, Web Services, Mashups etc. Yet, due to various reasons (lack of comput...
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
DCC
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
119
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
125
Voted
PAM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Based on measurements in live GPRS networks, the degree of selfsimilarity for the aggregated WAP and WEB traffic is investigated by utilizing six well established Hurst p...