1431 search results - page 112 / 287 » The complexity of random ordered structures |
208
click to vote
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper proposes a new class of two-channel structural perfect reconstruction (PR) FIR filter banks (FBs) called the multi-plet FB. It generalizes structural PR FBs proposed by...
120
click to vote
KDD
1998
ACM
15 years 7 months ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
109
click to vote
RSA
2010
15 years 1 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
130
click to vote
IRI
2006
IEEE
15 years 9 months ago
2006
IEEE
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
124
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...