Sciweavers

3136 search results - page 419 / 628
» Complex networks and evolutionary computation
Sort
View
FOCS
1998
IEEE
15 years 11 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
BC
1998
84views more  BC 1998»
15 years 6 months ago
Stimulus-induced bifurcations in discrete-time neural oscillators
Abstract. Based on theoretical issues and neurobiological evidence, considerable interest has recently focused on dynamic computational elements in neural systems. Such elements re...
Ali A. Minai, Tirunelveli Anand
ICPR
2002
IEEE
16 years 7 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
16 years 7 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
ATAL
2009
Springer
16 years 1 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein