Sciweavers

3719 search results - page 115 / 744
» order 2010
Sort
View
70
Voted
SPAA
2010
ACM
15 years 5 months ago
Multi-sided shared coins and randomized set-agreement
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Keren Censor Hillel
TIT
2010
90views Education» more  TIT 2010»
14 years 7 months ago
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
Giacomo Como
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
14 years 7 months ago
On optimal input signal design for frequency response estimation
This paper studies optimal input excitation design for parametric frequency response estimation. We will focus on least-squares estimation of Finite Impulse Response (FIR) models a...
Bo Wahlberg, Håkan Hjalmarsson, Petre Stoica
77
Voted
SIAMNUM
2010
89views more  SIAMNUM 2010»
14 years 7 months ago
Convergence of a Fully Conservative Volume Corrected Characteristic Method for Transport Problems
We consider the convergence of a volume corrected characteristics-mixed method (VCCMM) for advection-diffusion systems. It is known that, without volume correction, the method is f...
Todd Arbogast, Wen-Hao Wang
79
Voted
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
15 years 10 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen