6315 search results - page 266 / 1263 » Approximating Solution Structure |
187
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
168
click to vote
ISM
2008
IEEE
16 years 1 months ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
153
click to vote
FLAIRS
2004
15 years 8 months ago
2004
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
194
click to vote
CP
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
176
click to vote
ISAAC
2004
Springer
16 years 9 hour ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...