4744 search results - page 490 / 949 » Connected Computing |
187
click to vote
NIPS
2004
15 years 8 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
174
click to vote
NIPS
2004
15 years 8 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
188
click to vote
WOB
2004
15 years 8 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
167
click to vote
NIPS
2003
15 years 8 months ago
2003
We consider the question of predicting nonlinear time series. Kernel Dynamical Modeling (KDM), a new method based on kernels, is proposed as an extension to linear dynamical model...
190
click to vote
AAAI
2000
15 years 8 months ago
2000
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...