481 search results - page 82 / 97 » Martin's game: a lower bound for the number of sets |
DSD
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
SISAP
2008
IEEE
14 years 3 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
ESCAPE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....