Sciweavers

1200 search results - page 141 / 240
» Marked Ancestor Problems
Sort
View
FOCM
2010
140views more  FOCM 2010»
15 years 3 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
134
Voted
FS
2010
95views more  FS 2010»
15 years 3 months ago
Pricing credit derivatives under incomplete information: a nonlinear-filtering approach
This paper considers a general reduced form pricing model for credit derivatives where default intensities are driven by some factor process X. The process X is not directly observ...
Rüdiger Frey, Wolfgang Runggaldier
PUC
2008
120views more  PUC 2008»
15 years 3 months ago
Technology scruples: why intimidation will not save the recording industry and how enchantment might
While the recording industry continues to lobby for increasingly draconian laws to protect their interests, users of digital technology continue to share files and copy protected ...
Mark Blythe, Peter C. Wright
LICS
2010
IEEE
15 years 3 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
140
Voted
SSS
2010
Springer
15 years 3 months ago
"Slow Is Fast" for Wireless Sensor Networks in the Presence of Message Losses
Abstract. Transformations from shared memory model to wireless sensor networks (WSNs) quickly become inefficient in the presence of prevalent message losses in WSNs, and this prohi...
Mahesh Arumugam, Murat Demirbas, Sandeep S. Kulkar...