Sciweavers

1717 search results - page 139 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
CVPR
2006
IEEE
16 years 8 months ago
Clustering Appearance for Scene Analysis
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
16 years 3 months ago
Hierarchical Linear Discriminant Analysis for Beamforming.
This paper demonstrates the applicability of the recently proposed supervised dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial locali...
Barry L. Drake, Haesun Park, Jaegul Choo
BMCBI
2006
192views more  BMCBI 2006»
15 years 6 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...
TVLSI
2008
108views more  TVLSI 2008»
15 years 6 months ago
Unified Convolutional/Turbo Decoder Design Using Tile-Based Timing Analysis of VA/MAP Kernel
To satisfy the advanced forward-error-correction (FEC) standards, in which the Convolutional code and Turbo code may co-exit, a prototype design of a unified Convolutional/Turbo de...
Fan-Min Li, Cheng-Hung Lin, An-Yeu Wu
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 6 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau