4926 search results - page 126 / 986 » Two Graph Algorithms On an Associative Computing Model |
132
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
102
click to vote
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
120
Voted
ALGORITHMICA
2004
15 years 2 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
109
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed ...
117
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...