7129 search results - page 705 / 1426 » Approximation Algorithms for Treewidth |
206
click to vote
ALT
2008
Springer
16 years 4 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
145
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
169
click to vote
LATIN
2010
Springer
16 years 2 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
190
click to vote
ICTAI
2009
IEEE
16 years 1 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
226
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...