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) & Signal. 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
Journal ArticleDOI
02 May 1997-Science
TL;DR: The microfluidic networks used to pattern biomolecules with high resolution on a variety of substrates suggest a practical way to incorporate biological material on technological substrates.
Abstract: Microfluidic networks (microFNs) were used to pattern biomolecules with high resolution on a variety of substrates (gold, glass, or polystyrene). Elastomeric microFNs localized chemical reactions between the biomolecules and the surface, requiring only microliters of reagent to cover square millimeter-sized areas. The networks were designed to ensure stability and filling of the microFN and allowed a homogeneous distribution and robust attachment of material to the substrate along the conduits in the microFN. Immunoglobulins patterned on substrates by means of microFNs remained strictly confined to areas enclosed by the network with submicron resolution and were viable for subsequent use in assays. The approach is simple and general enough to suggest a practical way to incorporate biological material on technological substrates.

818 citations

Book ChapterDOI
01 Aug 2012
TL;DR: A survey of a wide variety of text classification algorithms for a number of diverse domains, including target marketing, medical diagnosis, news group filtering, and document organization is provided.
Abstract: The problem of classification has been widely studied in the data mining, machine learning, database, and information retrieval communities with applications in a number of diverse domains, such as target marketing, medical diagnosis, news group filtering, and document organization. In this paper we will provide a survey of a wide variety of text classification algorithms.

818 citations

Book ChapterDOI
26 May 2013
TL;DR: This work describes plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, and shows an example application of such multi-linear maps that can be realized using the approximation.
Abstract: We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, and show an example application of such multi-linear maps that can be realized using our approximation. The security of our constructions relies on seemingly hard problems in ideal lattices, which can be viewed as extensions of the assumed hardness of the NTRU function.

817 citations

Proceedings ArticleDOI
20 May 2003
TL;DR: An application called 'Semantic Search' is presented which is built on these supporting technologies and is designed to improve traditional web searching and an overview of TAP, the application framework upon which the Semantic Search is built is provided.
Abstract: Activities such as Web Services and the Semantic Web are working to create a web of distributed machine understandable data. In this paper we present an application called 'Semantic Search' which is built on these supporting technologies and is designed to improve traditional web searching. We provide an overview of TAP, the application framework upon which the Semantic Search is built. We describe two implemented Semantic Search systems which, based on the denotation of the search query, augment traditional search results with relevant data aggregated from distributed sources. We also discuss some general issues related to searching and the Semantic Web and outline how an understanding of the semantics of the search terms can be used to provide better results.

817 citations

Book ChapterDOI
20 Aug 2000
TL;DR: A group signature scheme allows a group member to sign messages anonymously on behalf of the group but in the case of a dispute the identity of a signature's originator can be revealed (only) by a designated entity.
Abstract: A group signature scheme allows a group member to sign messages anonymously on behalf of the group However, in the case of a dispute, the identity of a signature's originator can be revealed (only) by a designated entity The interactive counterparts of group signatures are identity escrow schemes or group identification scheme with revocable anonymity This work introduces a new provably secure group signature and a companion identity escrow scheme that are significantly more efficient than the state of the art In its interactive, identity escrow form, our scheme is proven secure and coalition-resistant under the strong RSA and the decisional Diffie-Hellman assumptions The security of the noninteractive variant, ie, the group signature scheme, relies additionally on the Fiat-Shamir heuristic (also known as the random oracle model)

816 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