Sciweavers

6274 search results - page 466 / 1255
» From query complexity to computational complexity
Sort
View
IJAR
2008
67views more  IJAR 2008»
15 years 7 months ago
Implementing semantic merging operators using binary decision diagrams
There is a well-recognised need in diverse applications for reasoning with multiple, potentially inconsistent sources of information. One approach is to represent each source of i...
Nikos Gorogiannis, Anthony Hunter
TSP
2008
113views more  TSP 2008»
15 years 6 months ago
Avoiding Divergence in the Shalvi-Weinstein Algorithm
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
Maria D. Miranda, Magno T. M. Silva, Victor H. Nas...
JMLR
2011
125views more  JMLR 2011»
15 years 1 months ago
Approximate Marginals in Latent Gaussian Models
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
Botond Cseke, Tom Heskes
FAABS
2000
Springer
15 years 10 months ago
Design and Mathematical Analysis of Agent-Based Systems
Abstract. Agent-based systems that are composed of simple locally interacting agents but which demonstrate complex group behavior o er several advantages over traditional multi-age...
Kristina Lerman
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 8 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira