Sciweavers

2766 search results - page 301 / 554
» Algorithms for trigonometric polynomials
Sort
View
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
15 years 10 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
WINE
2005
Springer
206views Economy» more  WINE 2005»
15 years 10 months ago
Exchange Market Equilibria with Leontief's Utility: Freedom of Pricing Leads to Rationality
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
Yinyu Ye
COMPGEOM
2004
ACM
15 years 10 months ago
Computing persistent homology
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
Afra Zomorodian, Gunnar Carlsson
137
Voted
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
155
Voted
ICA
2004
Springer
15 years 10 months ago
Blind Signal Separation of Convolutive Mixtures: A Time-Domain Joint-Diagonalization Approach
We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary a...
Marcel Joho