Sciweavers

1149 search results - page 102 / 230
» Minimally non-Pfaffian graphs
Sort
View
NETWORKS
2010
15 years 4 months ago
Fixed-parameter tractability results for full-degree spanning tree and its dual
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
SIAMDM
2010
133views more  SIAMDM 2010»
15 years 4 months ago
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...
MASS
2010
159views Communications» more  MASS 2010»
15 years 1 months ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia
EMMCVPR
2011
Springer
14 years 6 months ago
Discrete Optimization of the Multiphase Piecewise Constant Mumford-Shah Functional
Abstract. The Mumford-Shah model has been one of the most powerful models in image segmentation and denoising. The optimization of the multiphase Mumford-Shah energy functional has...
Noha Youssry El-Zehiry, Leo Grady
COLT
2007
Springer
16 years 15 days ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum