Sciweavers

680 search results - page 98 / 136
» A randomized embedding algorithm for trees
Sort
View
ICALP
2005
Springer
14 years 2 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 2 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 8 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
ECCV
1992
Springer
14 years 10 months ago
Boundary Detection in Piecewise Homogeneous Textured Images
We address the problem of scale selection in texture analysis. Two di erent scale parameters, feature scale and statistical scale, are dened. Statistical scale is the size of the r...
Stefano Casadei, Sanjoy K. Mitter, Pietro Perona
CAV
2009
Springer
132views Hardware» more  CAV 2009»
14 years 9 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas