scispace - formally typeset
Search or ask a question
Institution

IBM

CompanyArmonk, New York, United States
About: IBM is a company organization based out in Armonk, New York, United States. It is known for research contribution in the topics: Layer (electronics) & Cache. The organization has 134567 authors who have published 253905 publications receiving 7458795 citations. The organization is also known as: International Business Machines Corporation & Big Blue.


Papers
More filters
Proceedings ArticleDOI
01 Jun 1996
TL;DR: A taxonomy of histograms that captures all previously proposed histogram types and indicates many new possibilities is provided, which introduces novel choices for several of the taxonomy dimensions, and derive new histograms types by combining choices in effective ways.
Abstract: Many commercial database systems maintain histograms to summarize the contents of relations and permit efficient estimation of query result sizes and access plan costs. Although several types of histograms have been proposed in the past, there has never been a systematic study of all histogram aspects, the available choices for each aspect, and the impact of such choices on histogram effectiveness. In this paper, we provide a taxonomy of histograms that captures all previously proposed histogram types and indicates many new possibilities. We introduce novel choices for several of the taxonomy dimensions, and derive new histogram types by combining choices in effective ways. We also show how sampling techniques can be used to reduce the cost of histogram construction. Finally, we present results from an empirical study of the proposed histogram types used in selectivity estimation of range predicates and identify the histogram types that have the best overall performance.

676 citations

Patent
Caglan M. Aras1, Luther B Griffin1, Fuyung Lai1, Arthur J. Stagg1, Kian-Bon K. Sy1 
27 Nov 1996
TL;DR: In this article, a method and apparatus for the automatic access control to multimedia presentations at the receiver in accordance with a viewer selected access mode and access classification data encoded into the multimedia presentation is presented.
Abstract: A method and apparatus for the automatic access control to multimedia presentations at the receiver in accordance with a viewer selected access mode and access classification data encoded into the multimedia presentation. Screening classification codes (SCCs) are embedded in the Audio Visual Material (AVM) delivered to a subscribers home station. The screening classification codes identify the type of content that follows in the AVM stream. For instance, violent content (video and/or audio) provided to a home station may contain a SCC that indicates violent scenes or violent action is forth coming in the AVM stream. The home station takes the SCC that are encoded and/or embedded in the AVM stream and applies a subscriber selected screening criteria. The screening criteria or suppression criteria are AVM manipulation commands. These AVM manipulation commands can blank the audio and/or video, cause the display of the last acceptable frame, perform obscuration transforms on the AVM stream or otherwise manipulate the audio and/or video portions of the AVM stream. The subscriber associates an AVM manipulation command with each of the available SCCs. The home station applies the subscriber desired manipulation commands to the AVM stream. Information on the subscriber selections are provided to an upstream node for subscriber behavior collection analysis.

676 citations

Book ChapterDOI
11 Sep 2002
TL;DR: The anonymous credential system of Camenisch and Lysyanskaya as discussed by the authors is a generalization of the anonymous credential scheme of the original anonymous signature scheme and is a building block for anonymity-enhancing cryptographic systems, such as electronic cash, group signatures and anonymous credential systems.
Abstract: Digital signature schemes are a fundamental cryptographic primitive, of use both in its own right, and as a building block in cryptographic protocol design. In this paper, we propose a practical and provably secure signature scheme and show protocols (1) for issuing a signature on a committed value (so the signer has no information about the signed value), and (2) for proving knowledge of a signature on a committed value. This signature scheme and corresponding protocols are a building block for the design of anonymity-enhancing cryptographic systems, such as electronic cash, group signatures, and anonymous credential systems. The security of our signature scheme and protocols relies on the Strong RSA assumption. These results are a generalization of the anonymous credential system of Camenisch and Lysyanskaya.

675 citations

Journal ArticleDOI
TL;DR: It is observed that a strong electric field shifts to higher energies the photoluminescence and photocurrent peaks of a GaAs-${\mathrm{Ga}}_{0.65}$ as superlattice of period D (=65 \AA{}), which is explained by a field-induced localization of carriers to isolated quantum wells.
Abstract: We have observed that a strong electric field $\mathcal{E}$ shifts to higher energies the photoluminescence and photocurrent peaks of a GaAs-${\mathrm{Ga}}_{0.65}$${\mathrm{Al}}_{0.35}$As superlattice of period $D$ (=65 \AA{}), which we explain by a field-induced localization of carriers to isolated quantum wells. Good agreement is found between observed and calculated shifts when the large field-induced increase of the exciton binding energy is taken into account. At moderate fields [\ensuremath{\cong}(2-3)\ifmmode\times\else\texttimes\fi{}${10}^{4}$ V/cm], the coupling between adjacent wells is manifested by four additional peaks that shift at the rates $\ifmmode\pm\else\textpm\fi{}e\mathcal{E}D$ and $\ifmmode\pm\else\textpm\fi{}2e\mathcal{E}D$ and correspond to transitions that involve different levels of the Stark ladder.

674 citations

Proceedings ArticleDOI
Miklós Ajtai1, Cynthia Dwork1
04 May 1997
TL;DR: A probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be solved in polynomial time is presented.

673 citations


Authors

Showing all 134658 results

NameH-indexPapersCitations
Zhong Lin Wang2452529259003
Anil K. Jain1831016192151
Hyun-Chul Kim1764076183227
Rodney S. Ruoff164666194902
Tobin J. Marks1591621111604
Jean M. J. Fréchet15472690295
Albert-László Barabási152438200119
György Buzsáki15044696433
Stanislas Dehaene14945686539
Philip S. Yu1481914107374
James M. Tour14385991364
Thomas P. Russell141101280055
Naomi J. Halas14043582040
Steven G. Louie13777788794
Daphne Koller13536771073
Network Information
Related Institutions (5)
Carnegie Mellon University
104.3K papers, 5.9M citations

93% related

Georgia Institute of Technology
119K papers, 4.6M citations

92% related

Bell Labs
59.8K papers, 3.1M citations

90% related

Microsoft
86.9K papers, 4.1M citations

89% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

88% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202330
2022137
20213,163
20206,336
20196,427
20186,278