Sciweavers

3874 search results - page 598 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
AAAI
2010
15 years 5 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 4 months ago
Interference Alignment as a Rank Constrained Rank Minimization
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
EOR
2006
73views more  EOR 2006»
15 years 4 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
IPL
2008
89views more  IPL 2008»
15 years 4 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
150
Voted
IPL
2007
96views more  IPL 2007»
15 years 4 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...