5100 search results - page 209 / 1020 » The Linear Complexity of a Graph |
94
Voted
CORR
2006
Springer
15 years 18 days ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
JSAC
2007
15 years 13 days ago
2007
Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
110
Voted
SIAMJO
2010
14 years 11 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
108
Voted
EJC
2006
15 years 17 days ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
161
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Recently SVMs using spatial pyramid matching (SPM)
kernel have been highly successful in image classification.
Despite its popularity, these nonlinear SVMs have a complexity
O(n...