Results 1  10
of
2,884
Tight Bounds for 2Dimensional Indexing Schemes
 In Proc. ACM Symp. Principles of Database Systems
, 1998
"... We study the tradeoff between storage redundancy and access overhead for range queries, using the framework of [6]. We show that the Fibonacci workload of size n, which is the regular 2dimensional grid rotated by the golden ratio, does not admit an indexing scheme with access overhead less than th ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
the block size B (the worst possible access overhead) , even for storage redundancy as high as c log n, for some constant c. We also show that this bound is tight (up to a constant factor) by providing an indexing scheme with storage redundancy \Theta(log n) and constant access overhead, for any 2
Gaussian interference channel capacity to within one bit
 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing
"... Abstract—The capacity of the twouser Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing o ..."
Abstract

Cited by 452 (28 self)
 Add to MetaCart
outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a very simple and explicit Han–Kobayashi type scheme can achieve to within a single bit per second per hertz (bit
A Concrete Security Treatment of Symmetric Encryption
 Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE
, 1997
"... We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four di erent notions of security against chosen plaintext attack and analyze the concrete complexity ofreductions among them, providing both upper and lower bounds, and obtaining tight ..."
Abstract

Cited by 421 (65 self)
 Add to MetaCart
We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four di erent notions of security against chosen plaintext attack and analyze the concrete complexity ofreductions among them, providing both upper and lower bounds, and obtaining tight
Image Representation Using 2D Gabor Wavelets
 IEEE Trans. Pattern Analysis and Machine Intelligence
, 1996
"... This paper extends to two dimensions the frame criterion developed by Daubechies for onedimensional wavelets, and it computes the frame bounds for the particular case of 2D Gabor wavelets. Completeness criteria for 2D Gabor image representations are important because of their increasing role in man ..."
Abstract

Cited by 375 (4 self)
 Add to MetaCart
This paper extends to two dimensions the frame criterion developed by Daubechies for onedimensional wavelets, and it computes the frame bounds for the particular case of 2D Gabor wavelets. Completeness criteria for 2D Gabor image representations are important because of their increasing role
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
 In proceedings of ACM SIGMOD Conference on Management of Data
, 2002
"... Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data.. The most promising solutions' involve performing dimensionality reduction on the data, then indexing the reduced d ..."
Abstract

Cited by 316 (33 self)
 Add to MetaCart
distance approximation, and a nonlower bounding, but very tight Euclidean distance approximation and show how they can support fast exact searchin& and even faster approximate searching on the same index structure. We theoretically and empirically compare APCA to all the other techniques
Automatic linguistic indexing of pictures by a statistical modeling approach
 PAMI
"... Automatic linguistic indexing of pictures is an important but highly challenging problem for researchers in computer vision and contentbased image retrieval. In this paper, we introduce a statistical modeling approach to this problem. Categorized images are used to train a dictionary of hundreds of ..."
Abstract

Cited by 300 (25 self)
 Add to MetaCart
on the characterizing stochastic process is computed. A high likelihood indicates a strong association. In our experimental implementation, we focus on a particular group of stochastic processes, that is, the twodimensional multiresolution hidden Markov models (2D MHMMs). We implemented and tested our ALIP (Automatic
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 298 (24 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits
Differential spacetime modulation
 IEEE Trans. Inform. Theory
, 2000
"... Abstract—Space–time coding and modulation exploit the presence of multiple transmit antennas to improve performance on multipath radio channels. Thus far, most work on space–time coding has assumed that perfect channel estimates are available at the receiver. In certain situations, however, it may b ..."
Abstract

Cited by 269 (1 self)
 Add to MetaCart
codes. This approach can be applied to any number of transmit and receive antennas, and any signal constellation. We also derive lowcomplexity differential receivers, error bounds, and modulator design criteria, which we use to construct optimal differential modulation schemes for two transmit
Tight Bounds on the Information Rate of Secret Sharing Schemes
 Designs, Codes and Cryptography
, 1997
"... A secret sharing scheme is a protocol by means of which a dealer distributes a secret s among a set of participants P in such a way that only qualified subsets of P can reconstruct the value of s whereas any other subset of P; nonqualified to know s; cannot determine anything about the value of ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
rate obtained in the literature can be seen as corollaries of our result. Moreover, we prove that for any integer d there exists a dregular graph for which any secret sharing scheme has information rate upper bounded by 2=(d + 1). This improves on van Dijk's result [14] and matches
Bounded geometries, fractals, and lowdistortion embeddings
"... The doubling constant of a metric space (X; d) is thesmallest value * such that every ball in X can be covered by * balls of half the radius. The doubling dimension of X isthen defined as dim(X) = log2 *. A metric (or sequence ofmetrics) is called doubling precisely when its doubling dimension is ..."
Abstract

Cited by 198 (40 self)
 Add to MetaCart
is bounded. This is a robust class of metric spaceswhich contains many families of metrics that occur in applied settings.We give tight bounds for embedding doubling metrics into (lowdimensional) normed spaces. We consider bothgeneral doubling metrics, as well as more restricted families such as those
Results 1  10
of
2,884