Sciweavers

7840 search results - page 1493 / 1568
» On generalized Ramsey numbers
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 8 months ago
Particle Filtering for Large Dimensional State Spaces with Multimodal Observation Likelihoods
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...
Namrata Vaswani
CORR
2008
Springer
105views Education» more  CORR 2008»
13 years 8 months ago
Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability
Equivocation has been widely used as a measure of security after Shannon[10]. For an infinite system such as the wiretap channel defined in [2], equivocation is unbounded and so e...
Chung Chan
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 8 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
« Prev « First page 1493 / 1568 Last » Next »