Sciweavers

356 search results - page 45 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
14 years 1 months ago
A memory grouping method for sharing memory BIST logic
- With the increasing demand for SoCs to include rich functionality, SoCs are being designed with hundreds of small memories with different sizes and frequencies. If memory BIST lo...
Masahide Miyazaki, Tomokazu Yoneda, Hideo Fujiwara
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
14 years 1 months ago
Hierarchical genetic programming based on test input subsets
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
David Jackson
TIT
2010
130views Education» more  TIT 2010»
13 years 2 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
MP
2006
119views more  MP 2006»
13 years 7 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
MIR
2005
ACM
198views Multimedia» more  MIR 2005»
14 years 1 months ago
Semi-automatic video annotation based on active learning with multiple complementary predictors
In this paper, we will propose a novel semi-automatic annotation scheme for video semantic classification. It is well known that the large gap between high-level semantics and low...
Yan Song, Xian-Sheng Hua, Li-Rong Dai, Meng Wang