Sciweavers

8647 search results - page 55 / 1730
» The Container Selection Problem
Sort
View
116
Voted
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
15 years 8 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
141
Voted
PAMI
2010
192views more  PAMI 2010»
15 years 28 days ago
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...
Carlos Alzate, Johan A. K. Suykens
112
Voted
DAM
2008
140views more  DAM 2008»
15 years 2 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 2 months ago
About the domino problem in the hyperbolic plane, a new solution
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...
Maurice Margenstern
STOC
1997
ACM
116views Algorithms» more  STOC 1997»
15 years 6 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
Itzhak Parnafes, Ran Raz, Avi Wigderson