20066 search results - page 248 / 4014 » T Spaces |
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the s...
157
Voted
ECCC
2010
15 years 6 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
177
click to vote
EJC
2008
15 years 6 months ago
2008
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
196
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
147
click to vote
DCG
2007
15 years 6 months ago
2007
The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, ...