214 search results - page 25 / 43 » The node capacitated graph partitioning problem: A computati... |
164
click to vote
PACT
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
159
Voted
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
137
click to vote
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
142
click to vote
NIPS
2008
15 years 7 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
178
Voted
CN
2008
15 years 5 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...