1469 search results - page 197 / 294 » Approximate polynomial decomposition |
206
click to vote
CONCUR
2009
Springer
16 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
249
click to vote
SDM
2011
SIAM
14 years 10 months ago
2011
SIAM
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
214
click to vote
PODS
2004
ACM
16 years 7 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
192
click to vote
ICIP
2001
IEEE
16 years 9 months ago
2001
IEEE
It is well known that wavelets provide good non-linear approximation of one-dimensional (1-D) piecewise smooth functions. However, it has been shown that the use of a basis with g...
192
Voted
STOC
2005
ACM
16 years 8 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...