500 search results - page 74 / 100 » Approximation algorithms for maximum independent set of pseu... |
122
click to vote
ICMCS
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we present an AUC (i.e., the Area Under the Curve of Receiver Operating Characteristics (ROC)) maximization based learning algorithm to design the classifier for ma...
89
Voted
3DPVT
2006
IEEE
15 years 7 months ago
2006
IEEE
We present a systematic view planning method to assist construction of 3-D models of large outdoor sites using a mobile robot platform with mounted scanner. In the first stage, w...
140
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
128
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
130
click to vote
FLAIRS
2008
15 years 2 months ago
2008
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...