Sciweavers

768 search results - page 110 / 154
» Asymptotic Cellular Complexity
Sort
View
CISS
2007
IEEE
14 years 2 months ago
On Capacity of Automatic Target Recognition Systems Under the Constraint of PCA-Encoding
Limiting capabilities of practical recognition systems are determined by a variety of factors that include source encoding techniques, quality of images, complexity of underlying ...
Xiaohan Chen, Natalia A. Schmid
ITCC
2005
IEEE
14 years 1 months ago
Design Theoretic Approach to Replicated Declustering
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
Ali Saman Tosun
COCOON
2005
Springer
14 years 1 months ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 1 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche