1542 search results - page 72 / 309 » Kernelization of packing problems |
109
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
110
click to vote
RECOMB
2004
Springer
16 years 5 days ago
2004
Springer
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
100
click to vote
GCB
2009
Springer
15 years 3 months ago
2009
Springer
Abstract: Graphs are often used to describe and analyze the geometry and physicochemical composition of biomolecular structures, such as chemical compounds and protein active sites...
102
click to vote
JMLR
2006
14 years 11 months ago
2006
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
112
click to vote
ACSAC
2010
IEEE
14 years 10 months ago
2010
IEEE
Code injection continues to pose a serious threat to computer systems. Among existing solutions, W X is a notable approach to prevent the execution of injected code. In this paper...