63 search results - page 10 / 13 » Lower Bounds for Reducibility to the Kolmogorov Random Strin... |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
MIDDLEWARE
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
ECCC
2011
13 years 2 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
SMA
2010
ACM
13 years 7 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
AAAI
1992
13 years 8 months ago
1992
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...