Browsing LCS Publications by Title
Now showing items 231-250 of 1163
-
Concurrent/Resettable Zero-Knowledge Protocols for NP in the Public Key Model
(2000-08)We propose a four-round protocol for concurrent and resettable zero-knowledge arguments for any langauge in NP, assuming the verifier has a pre-registered public-key. We also propose a three-round protocol with an additional ... -
Congestion Control in Routing Networks
(1986-10)Multistage routing networks present an attractive cost-effective method of interconnection for medium to large scale multiprocessors. Recent results concerning performance degradation in the presence of "hot spots" have ... -
Connecting Homes to the Internet: An Engineering Cost Model of Cable vs. ISDN
(1995-06)Using the World Wide Web at 28.8 Kbps (or less) can be a frustrating experience: a multimedia page that takes a fraction of a second to download at Ethernet speeds takes many seconds at modem rates. Two enhancements to ... -
Consensus in the Presence of Partial Synchrony
(1985-10)The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper ... -
Conservative Logic
(1981-05)Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of physics, such as the reversibility of the dynamical laws and the conservation of certain additive ... -
Conservative Radiance Interpolants for Ray Tracing
(1996-04)Classical ray-tracing algorithms compute radiance returning to the eye along one or more sample rays through each pixel of an image. The output of a ray-tracing algorithm, although potentially photorealistic, is a ... -
A Constraint Representation and Explanation Facility for Renal Physiology
(1984-06)Current research in Artificial Intelligence has yielded computer programs which have potential to augment the physician's ability to diagnose illness. The medical diagnoses programs of the first generation contain medical ... -
Constructing a Highly-available Location Service for a Distributed Environment
(1988-01)One possible advantage a distributed system has over a centralized system is the ability to move objects from one node to another. For example, we may want to move an object if the node where it resides is overloaded. ... -
Construction and Analysis of Network Flow Problem Which Forces Karzanov Algorithm 0(n^3) Running Time
(1977-05)The intest of this paper is to demonstrate the construction of a network flow problem which will force the Karzanov "Preflow" algorithm to run in its theoretic worst case time 0(n^3). Once such a "bad case" network has ... -
Construction Heuristics for Geometry and a Vector Algebra Representation of Geometry
(1972-06)Heuristics for generating constructions to help solve high school geometry problems are given. Many examples of the use of these heuristics are given. A method of translating geometry problems into vector algebra problems ... -
A Constructive Approach to Artificial Intelligence Reexamined
(1992-07)Made-Up Minds: A Constructivist Approach to Artificial Intelligence, a Ph.D. thesis by Gary Drescher (MIT, Computer Science, September 1989) and a book published by MIT Press (1991) describe a learning system which controls ... -
A Content Routing System for Distributed Information Systems
(1993-06)We describe the first system that provides query based associative access to the contents of distributed information servers. Queries describe desired object attributes, and are automatically forwarded to servers that ... -
Controlled Information Sharing in a Computer Utility
(1969-10)A computer utility is envisioned as a large, multi-access computer system providing its users with the ability to store information and share its use with other system users. This thesis considers the nature of information ... -
Controlling Worst-case Performance of a Communication Protocol and Dynamic Resource Management
(1987-05)This paper raises a fundamental questions, neglected so far in the literature: how to make a distributed algorithm robust against input errors and wrong probabilistic assumptions about the distribution of the inputs or of ... -
Cooperation of Mutually Suspicious Subsystems in a Computer Utility
(1972-09)This thesis describes practical protection mechanisms that allow mutually suspicious subsystems to cooperate in a single computation and still be protected from one another. The mechanisms are based on the division of a ... -
Cooperative Office Work, Teleconferencing and Calendar Management: A Collection of Papers
(1982-05)This technical memo consists of a collection of papers that have been presented at conferences. They all present results of research in the "Multi-person Informational Work" project in the Office Automation Group. -
Coordinated Resource Management in a Replicated Objected Server
(1994-02)We propose several new techniques for resource management in a replicated object server. By coordinating cache and disk usage among the replicas, these techniques increase throughput and reduce fetch latency. Cache ... -
Coordinating Pebble Motion on Graphs, The Diameter of Permutation Groups, and Applications
(1984-05)The problem of memory management in totally distributed computing systems leads to the following movers' problem on graphics: Let G be a graph with n vertices with k < n pebbles number 1...,k on distinct vertices. A move ... -
Coordination of Asynchronous Event
(1970-06)The way activity in a system proceeds is that events occur as a result of some conditions and lead to some new conditions which make other events possible. Often it is necessary to coordinate such events to ensure proper ...