9842 search results - page 1448 / 1969 » The Complexity of the Matching-Cut Problem |
187
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...
178
Voted
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— The Particle Swarm Optimization (PSO) algorithm is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper p...
182
click to vote
CLUSTER
2008
IEEE
16 years 1 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
187
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
163
Voted
DSD
2008
IEEE
16 years 1 months ago
2008
IEEE
Although preliminary analysis frameworks point out the performance speed-ups achievable by on-chip networks with respect to state-of-the-art interconnects, the area concern remain...