Sciweavers

339 search results - page 31 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
DCC
2002
IEEE
14 years 8 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
FOCS
2002
IEEE
14 years 1 months ago
Optimal System of Loops on an Orientable Surface
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
Éric Colin de Verdière, Francis Laza...
ICPR
2000
IEEE
14 years 9 months ago
Optimal Color Composition Matching of Images
Color features are among the most important features used in image database retrieval, especially in cases where no additional semantic information is available. Due to its compac...
Jianying Hu, Aleksandra Mojsilovic
FLAIRS
2004
13 years 10 months ago
Multimodal Function Optimization Using Local Ruggedness Information
In multimodal function optimization, niching techniques create diversification within the population, thus encouraging heterogeneous convergence. The key to the effective diversif...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
GLOBECOM
2008
IEEE
13 years 9 months ago
Cooperative Spectrum Allocation in Centralized Cognitive Networks Using Bipartite Matching
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
Chengshi Zhao, Mingrui Zou, Bin Shen, Bumjung Kim,...