7326 search results - page 1240 / 1466 » Methods for modalities 3 |
172
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present recent results from the LCDM3 collaboration between UIUC Astronomy and NCSA to deploy supercomputing cluster resources and machine learning algorithms for the mining of ...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
181
Voted
DM
2010
15 years 6 months ago
2010
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
163
click to vote
DAM
2008
15 years 6 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
181
click to vote
DCG
2008
15 years 6 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...