4926 search results - page 303 / 986 » Two Graph Algorithms On an Associative Computing Model |
137
click to vote
ICPR
2010
IEEE
16 years 1 days ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
161
Voted
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
178
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
142
click to vote
WG
1998
Springer
15 years 9 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
160
click to vote
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...