2312 search results - page 347 / 463 » The complexity of estimating min-entropy |
194
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Ultra wide band (UWB) ad-hoc networks have attracted much research attention in recent years. This paper proposes and investigates a new distributed cooperative routing strateg...
215
Voted
VLDB
2005
ACM
16 years 10 days ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
186
click to vote
CVPR
1997
IEEE
15 years 11 months ago
1997
IEEE
The surface growing framework presented by Besl and Jain [2] has served as the basis for many range segmentation techniques. It has been augmented with alternative fitting techni...
180
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
226
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...