Sciweavers

600 search results - page 33 / 120
» Problems and results in extremal combinatorics - II
Sort
View
DAM
2007
153views more  DAM 2007»
13 years 8 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
COCOON
2009
Springer
14 years 2 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...
COCOON
2008
Springer
13 years 9 months ago
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
Hung Q. Ngo, Yang Wang 0014, Anh Le
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 8 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
PR
2006
111views more  PR 2006»
13 years 8 months ago
An adaptive error penalization method for training an efficient and generalized SVM
A novel training method has been proposed for increasing efficiency and generalization of support vector machine (SVM). The efficiency of SVM in classification is directly determi...
Yiqiang Zhan, Dinggang Shen