5215 search results - page 656 / 1043 » Quantum clustering algorithms |
175
click to vote
ECSQARU
2003
Springer
16 years 13 hour ago
2003
Springer
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
163
click to vote
ICIAP
2003
ACM
16 years 2 hour ago
2003
ACM
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
242
click to vote
ICOIN
2003
Springer
16 years 1 hour ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
205
click to vote
ICARCV
2002
IEEE
15 years 11 months ago
2002
IEEE
Cooperative robotic systems provide design and implementation challenges that are not easy to solve. This paper describes a parallel implementation for evolving cooperative roboti...
185
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...