Sciweavers

1969 search results - page 158 / 394
» Financial Theory 1
Sort
View
SIGPRO
2010
122views more  SIGPRO 2010»
15 years 4 months ago
Parameter estimation for exponential sums by approximate Prony method
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
Daniel Potts, Manfred Tasche
INFOCOM
2009
IEEE
16 years 1 months ago
Scaling Laws on Multicast Capacity of Large Scale Wireless Networks
—In this paper, we focus on the networking-theoretic multicast capacity for both random extended networks (REN) and random dense networks (RDN) under Gaussian Channel model, when...
Cheng Wang, Xiang-Yang Li, Changjun Jiang, ShaoJie...
FCT
2009
Springer
16 years 1 months ago
Alternating Weighted Automata
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 11 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 10 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...