Sciweavers

2766 search results - page 382 / 554
» Algorithms for trigonometric polynomials
Sort
View
LATA
2009
Springer
15 years 11 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
INFOCOM
2009
IEEE
15 years 11 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
ICPADS
2007
IEEE
15 years 10 months ago
Energy-efficient anonymous multicast in mobile ad-hoc networks
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...
Jung-Chun Kao, Radu Marculescu
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
15 years 10 months ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
15 years 10 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan