187 search results - page 26 / 38 » On the uniform edge-partition of a tree |
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
PODS
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
SIAMCOMP
2002
14 years 9 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
102
click to vote
RSA
2010
14 years 7 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
104
click to vote
ARTCOM
2009
IEEE
14 years 7 months ago
2009
IEEE
A new adaptive multispectral image compression technique based on the regions identified is proposed. The algorithm is adaptive in the sense that according to the data type class ...