Sciweavers

93 search results - page 14 / 19
» The complexity of the weight problem for permutation and mat...
Sort
View
IDA
2009
Springer
13 years 5 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis
WAIM
2009
Springer
14 years 17 min ago
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
Liangcai Shu, Jinhui Wu, Lei Yu, Weiyi Meng
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 8 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 1 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 24 days ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...