Sciweavers

385 search results - page 39 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 10 months ago
The discrete Fourier transform: A canonical basis of eigenfunctions
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
ACL
2008
13 years 11 months ago
Phrase Table Training for Precision and Recall: What Makes a Good Phrase and a Good Phrase Pair?
In this work, the problem of extracting phrase translation is formulated as an information retrieval process implemented with a log-linear model aiming for a balanced precision an...
Yonggang Deng, Jia Xu, Yuqing Gao
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
EC
1998
178views ECommerce» more  EC 1998»
13 years 10 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
PPOPP
2010
ACM
14 years 7 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...