Sciweavers

5244 search results - page 6 / 1049
» When are two algorithms the same
Sort
View
SODA
1996
ACM
140views Algorithms» more  SODA 1996»
13 years 9 months ago
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
Richard Cole, Ramesh Hariharan
JEA
2008
97views more  JEA 2008»
13 years 7 months ago
Approximating the true evolutionary distance between two genomes
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
Krister M. Swenson, Mark Marron, Joel V. Earnest-D...
ICDCS
1996
IEEE
13 years 11 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg
SDM
2010
SIAM
226views Data Mining» more  SDM 2010»
13 years 9 months ago
Two-View Transductive Support Vector Machines
Obtaining high-quality and up-to-date labeled data can be difficult in many real-world machine learning applications, especially for Internet classification tasks like review spam...
Guangxia Li, Steven C. H. Hoi, Kuiyu Chang
ICC
2009
IEEE
101views Communications» more  ICC 2009»
13 years 5 months ago
Using Limited Feedback in Power Allocation Design for a Two-Hop Relay OFDM System
In this paper, we study power allocation (PA) in a single-relay OFDM system with limited feedback. We propose a PA scheme that uses a codebook of quantized PA vectors designed offl...
Mahdi Hajiaghayi, Min Dong, Ben Liang