4926 search results - page 158 / 986 » Two Graph Algorithms On an Associative Computing Model |
149
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
141
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
133
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— The paper considers the algorithm NLU for distributed (vector) parameter estimation in sensor networks, where, the local observation models are nonlinear, and inter-sen...
155
click to vote
CAISE
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
165
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...