Sciweavers

2314 search results - page 311 / 463
» Minimal Partitions of a Graph
Sort
View
73
Voted
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 4 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
DPD
2007
84views more  DPD 2007»
15 years 3 months ago
Disseminating dependent data in wireless broadcast environments
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
Chuan-Ming Liu, Kun-Feng Lin
JUCS
2010
148views more  JUCS 2010»
15 years 2 months ago
Applying RFD to Construct Optimal Quality-Investment Trees
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
126
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Dual constrained TV-based regularization
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
Camille Couprie, Hugues Talbot, Jean-Christophe Pe...
ICASSP
2011
IEEE
14 years 7 months ago
Median filter with absolute value norm spatial regularization
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...
Nilanjan Ray