Sciweavers

721 search results - page 75 / 145
» Almost universal graphs
Sort
View
TON
2008
106views more  TON 2008»
13 years 9 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
NETWORKS
2002
13 years 9 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
CVPR
2010
IEEE
14 years 6 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
SAMOS
2004
Springer
14 years 3 months ago
A Novel Data-Path for Accelerating DSP Kernels
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...
Michalis D. Galanis, George Theodoridis, Spyros Tr...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 3 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao