Sciweavers

1282 search results - page 37 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Interference alignment in single-beam MIMO networks via homotopy continuation
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
Oscar Gonzalez, Ignacio Santamaría
ICASSP
2011
IEEE
12 years 11 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
ISAAC
2004
Springer
114views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
RNA is generally a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA mole...
Markus Bauer, Gunnar W. Klau
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 5 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
IPMI
2009
Springer
14 years 2 months ago
Generalized L2-Divergence and Its Application to Shape Alignment
This paper proposes a novel and robust approach to the groupwise point-sets registration problem in the presence of large amounts of noise and outliers. Each of the point sets is r...
Fei Wang, Baba C. Vemuri, Tanveer Fathima Syeda-Ma...