Sciweavers

3820 search results - page 138 / 764
» Bounded Model Debugging
Sort
View
112
Voted
MST
1998
76views more  MST 1998»
15 years 2 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
135
Voted
ICASSP
2009
IEEE
15 years 12 days ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
131
Voted
TSP
2011
170views more  TSP 2011»
14 years 9 months ago
Joint TDOA and FDOA Estimation: A Conditional Bound and Its Use for Optimally Weighted Localization
—Modern passive emitter-location systems are often based on joint estimation of the time-difference of arrival (TDOA) and frequency-difference of arrival (FDOA) of an unknown sig...
Arie Yeredor, Eyal Angel
105
Voted
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 2 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
110
Voted
AAECC
2003
Springer
119views Algorithms» more  AAECC 2003»
15 years 7 months ago
Optimal 2-Dimensional 3-Dispersion Lattices
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...
Moshe Schwartz, Tuvi Etzion