1469 search results - page 115 / 294 » Approximate polynomial decomposition |
SIAMCOMP
2000
14 years 9 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
ICIP
2008
IEEE
15 years 4 months ago
2008
IEEE
The wavelet transform hierarchically decomposes images with prescribed bases, while multilineal models search for optimal bases to adapt visual data. In this paper, we integrate t...
STACS
2010
Springer
15 years 5 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
ALGORITHMICA
2007
14 years 10 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
IJCAI
2001
14 years 11 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...