815 search results - page 119 / 163 » Approximate Entropy Reducts |
139
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
147
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
152
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
168
click to vote
ICCAD
2009
IEEE
15 years 3 months ago
2009
IEEE
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
147
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
We show quite good face clustering is possible for a dataset of inaccurately and ambiguously labelled face images. Our dataset is 44,773 face images, obtained by applying a face f...