2412 search results - page 388 / 483 » Which Problems Have Strongly Exponential Complexity |
AAAI
2010
13 years 9 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
AWIC
2003
Springer
14 years 29 days ago
2003
Springer
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
GRC
2010
IEEE
13 years 8 months ago
2010
IEEE
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...