Sciweavers

12194 search results - page 134 / 2439
» cans 2010
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 6 months ago
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
Leonid Barenboim, Michael Elkin
ICASSP
2010
IEEE
13 years 6 months ago
Direction-of-arrival and spatial signature estimation in antenna arrays with pairwise sensor calibration
In this paper, a new direction-of-arrival (DOA) estimation technique for partly calibrated arrays with pairwise calibrated sensors is proposed. Our approach is shown to substantia...
Pouyan Parvazi, Alex B. Gershman
MOR
2010
91views more  MOR 2010»
13 years 9 months ago
On the One-Dimensional Optimal Switching Problem
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...
Erhan Bayraktar, Masahiko Egami
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
13 years 9 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
AAECC
2010
Springer
99views Algorithms» more  AAECC 2010»
13 years 11 months ago
Structural theorems for symbolic summation
Abstract. Starting with Karr's structural theorem for summation --the discrete version of Liouville's structural theorem for integration-- we work out crucial properties ...
Carsten Schneider