scispace - formally typeset
Search or ask a question
Institution

Hewlett-Packard

CompanyPalo Alto, California, United States
About: Hewlett-Packard is a company organization based out in Palo Alto, California, United States. It is known for research contribution in the topics: Signal & Layer (electronics). The organization has 34663 authors who have published 59808 publications receiving 1467218 citations. The organization is also known as: Hewlett Packard & Hewlett-Packard Company.


Papers
More filters
Patent
01 Oct 1998
TL;DR: In this article, a method of configuring a peripheral device on a network without user intervention includes a server node receiving identification data for identifying the peripheral devices on the network and, if the peripheral device is a new device on the networks or a driver for the peripherals is not registered on the server node, the server nodes self-installing the driver for peripherals.
Abstract: A method of configuring a peripheral device on a network without user intervention includes a server node receiving identification data for identifying the peripheral device on the network and, if the peripheral device is a new device on the network or a driver for the peripheral device is not registered on the server node, the server node self-installing the driver for the peripheral device. As such, newly connected peripheral devices are automatically seen on a network and a driver for the peripheral device is automatically configured on a print server without any user intervention. Additionally, a communication port and queue for the device are also automatically created. Moreover, device configurations are dynamically and automatically updated on the print server for consistent, accurate network information.

289 citations

Proceedings ArticleDOI
28 Mar 2011
TL;DR: In this paper, a large study of information propagation within Twitter reveals that the majority of users act as passive information consumers and do not forward the content to the network, therefore, in order for individuals to become influential they must not only obtain attention and thus be popular, but also overcome user passivity.
Abstract: The ever-increasing amount of information flowing through Social Media forces the members of these networks to compete for attention and influence by relying on other people to spread their message. A large study of information propagation within Twitter reveals that the majority of users act as passive information consumers and do not forward the content to the network. Therefore, in order for individuals to become influential they must not only obtain attention and thus be popular, but also overcome user passivity. We propose an algorithm that determines the influence and passivity of users based on their information forwarding activity. An evaluation performed with a 2.5 million user dataset shows that our influence measure is a good predictor of URL clicks, outperforming several other measures that do not explicitly take user passivity into account. We demonstrate that high popularity does not necessarily imply high influence and vice-versa.

288 citations

Journal ArticleDOI
01 Sep 2000
TL;DR: The first lower bound on the peak-to-average power ratio (PAPR) of a constant energy code of a given length n, minimum Euclidean distance and rate is established and there exist asymptotically good codes whose PAPR is at most 8 log n.
Abstract: The first lower bound on the peak-to-average power ratio (PAPR) of a constant energy code of a given length n, minimum Euclidean distance and rate is established. Conversely, using a nonconstructive Varshamov-Gilbert style argument yields a lower bound on the achievable rate of a code of a given length, minimum Euclidean distance and maximum PAPR. The derivation of these bounds relies on a geometrical analysis of the PAPR of such a code. Further analysis shows that there exist asymptotically good codes whose PAPR is at most 8 log n. These bounds motivate the explicit construction of error-correcting codes with low PAPR. Bounds for exponential sums over Galois fields and rings are applied to obtain an upper bound of order (log n)/sup 2/ on the PAPRs of a constructive class of codes, the trace codes. This class includes the binary simplex code, duals of binary, primitive Bose-Chaudhuri-Hocquenghem (BCH) codes and a variety of their nonbinary analogs. Some open problems are identified.

288 citations

Journal ArticleDOI
TL;DR: The digitally configured memristor crossbars were used to perform logic functions, to serve as a routing fabric for interconnecting the FETs and as the target for storing information.
Abstract: Memristor crossbars were fabricated at 40 nm half-pitch, using nanoimprint lithography on the same substrate with Si metal-oxide-semiconductor field effect transistor (MOS FET) arrays to form fully integrated hybrid memory resistor (memristor)/transistor circuits. The digitally configured memristor crossbars were used to perform logic functions, to serve as a routing fabric for interconnecting the FETs and as the target for storing information. As an illustrative demonstration, the compound Boolean logic operation (A AND B) OR (C AND D) was performed with kilohertz frequency inputs, using resistor-based logic in a memristor crossbar with FET inverter/amplifier outputs. By routing the output signal of a logic operation back onto a target memristor inside the array, the crossbar was conditionally configured by setting the state of a nonvolatile switch. Such conditional programming illuminates the way for a variety of self-programmed logic arrays, and for electronic synaptic computing.

288 citations

Journal ArticleDOI
TL;DR: This is the first work to use semi-supervised learning techniques for the traffic classification problem and allows classifiers to be designed from training data that consists of only a few labeled and many unlabeled flows.

288 citations


Authors

Showing all 34676 results

NameH-indexPapersCitations
Andrew White1491494113874
Stephen R. Forrest1481041111816
Rafi Ahmed14663393190
Leonidas J. Guibas12469179200
Chenming Hu119129657264
Robert E. Tarjan11440067305
Hong-Jiang Zhang11246149068
Ching-Ping Wong106112842835
Guillermo Sapiro10466770128
James R. Heath10342558548
Arun Majumdar10245952464
Luca Benini101145347862
R. Stanley Williams10060546448
David M. Blei98378111547
Wei-Ying Ma9746440914
Network Information
Related Institutions (5)
IBM
253.9K papers, 7.4M citations

94% related

Samsung
163.6K papers, 2M citations

90% related

Carnegie Mellon University
104.3K papers, 5.9M citations

90% related

Microsoft
86.9K papers, 4.1M citations

90% related

Bell Labs
59.8K papers, 3.1M citations

89% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20231
202223
2021240
20201,028
20191,269
2018964