Sciweavers

144 search results - page 27 / 29
» Algorithms for the Hypergraph and the Minor Crossing Number ...
Sort
View
ISCC
2006
IEEE
134views Communications» more  ISCC 2006»
13 years 12 months ago
A Proposed Framework for Calibration of Available Bandwidth Estimation Tools
Examining the validity or accuracy of proposed available bandwidth estimation tools remains a challenging problem. A common approach consists of evaluating a newly developed tool ...
Joel Sommers, Paul Barford, Walter Willinger
PAKDD
2004
ACM
131views Data Mining» more  PAKDD 2004»
13 years 11 months ago
A Tree-Based Approach to the Discovery of Diagnostic Biomarkers for Ovarian Cancer
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
Jinyan Li, Kotagiri Ramamohanarao
ECCV
2006
Springer
13 years 9 months ago
Robust Homography Estimation from Planar Contours Based on Convexity
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
Alberto Ruiz, Pedro E. López-de-Teruel, Lor...
ICC
2007
IEEE
14 years 4 days ago
Optical WDM Network Planning Using Heterogeneous Multi-granularity OXCs
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...
FOCS
2008
IEEE
14 years 8 days ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...