Sciweavers

7150 search results - page 385 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 4 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
ICDCS
2007
IEEE
16 years 1 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
MICAI
2007
Springer
16 years 28 days ago
Weighted Instance-Based Learning Using Representative Intervals
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
Octavio Gómez, Eduardo F. Morales, Jes&uacu...
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
15 years 4 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...
CORR
2011
Springer
241views Education» more  CORR 2011»
15 years 1 months ago
An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...
Yangyang Xu, Wotao Yin, Zaiwen Wen, Yin Zhang