520 search results - page 23 / 104 » Reductions Between Expansion Problems |
ICCBR
2003
Springer
14 years 1 months ago
2003
Springer
Case-Based Reasoning systems usually retrieve cases using a similarity function based on K-NN or some derivatives. These functions are sensitive to irrelevant or noisy features. We...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
CHARME
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Automatic formal verification techniques generally require exponential resources with respect to the number of primary inputs of a netlist. In this paper, we present sev...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcomin...
IJCAI
2003
13 years 10 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...