7264 search results - page 148 / 1453 » A multiplicative up-propagation algorithm |
114
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
125
click to vote
IJBRA
2007
15 years 4 months ago
2007
: Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without co...
119
Voted
TROB
2008
15 years 4 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
143
Voted
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...
135
click to vote
CHES
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...