Sciweavers

457 search results - page 17 / 92
» Hypercomputation: computing more than the Turing machine
Sort
View
72
Voted
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 1 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
75
Voted
IPPS
2000
IEEE
15 years 2 months ago
Support for Recoverable Memory in the Distributed Virtual Communication Machine
The Distributed Virtual Communication Machine (DVCM) is a software communication architecture for clusters of workstations equipped with programmable network interfaces (NIs) for ...
Marcel-Catalin Rosu, Karsten Schwan
CHI
2011
ACM
14 years 1 months ago
Apolo: making sense of large network data by combining rich user interaction and machine learning
Extracting useful knowledge from large network datasets has become a fundamental challenge in many domains, from scientific literature to social networks and the web. We introduc...
Duen Horng Chau, Aniket Kittur, Jason I. Hong, Chr...
GPC
2009
Springer
14 years 7 months ago
I/O Device Virtualization in the Multi-core era, a QoS Perspective
In this paper, we propose an extension to the I/O device architecture, as recommended in the PCI-SIG IOV specification, for virtualizing network I/O devices. The aim is to enable ...
J. Lakshmi, S. K. Nandy
LCPC
2007
Springer
15 years 3 months ago
Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
Ronald Veldema, Michael Philippsen