To Appear

Publication List Details

Period

1991 - 2007

Number

19

Co-Authors

D Model Building of the Jaw Impression (2007)

To Appear, M. N. Ahmed, S. M. Yamany, E. E. Hemayed, A. A. Farag

A novel approach is proposed to obtain a record of the patient's occlusion using computer vision. Data acquisition is obtained using intra-oral video camera. The technique utilizes shape from...

Efficient Generation of (2007)

To Appear, Pankaj K. Agarwal, Mark De Berg, Dan Halperin, Micha Sharir

Let S be a collection of n rigid bodies in 3-space, and let D be a set of k directions in 3-space, where k is a small constant. A k-directional assembly sequence for S, with respect to D, is a linear...

Searches For Binary Stars In Globular Clusters (2007)

To Appear, Iau Symp, J. Makino, P. Hut, C. Pryor, J. M. Fletcher, ...

This paper briefly reviews what we do know and the prospects for further progress. 2. Radial Velocity Variables and the Binary Frequency

The Information Driveway (2007)

To Appear, Pierre A. Humblet, Markos G. Troulis, Claude E. Shannon

Regular analog telephone lines can be directly connected through the telephone network to ISDN terminals. By using appropriate modulation formats, they can carry digital traffic at rates approaching...

Dynamic Maintenance (2007)

To Appear, D. Halperin, J-c. Latombe, R. Motwani

We consider the following dynamic data structure problem. Given a collection of rigid bodies moving in 3-dimensional space and hinged together in a kinematic structure, our goal is to efficiently...

Flat Minima (2007)

To Appear, Fakultat Fur Informatik, Jurgen Schmidhuber

We present a new algorithm for finding low complexity neural networks with high generalization capability. The algorithm searches for a "flat" minimum of the error function. A flat minimum...

Page 1 of 11 13 January 1995 (2007)

To Appear

Early performance estimates for a new software system aid the design process by providing feedback when design decisions can be easily revised. Unfortunately, constructing a performance model of a...

A Fast, Compact Approximation of the Exponential Function (1999)

To Appear, Nicol N. Schraudolph

Neural network simulations often spend a large proportion of their time computing exponential functions. Since the exponentiation routines of typical math libraries are rather slow, their replacement...

A Parallel Disk Storage System for Realtime Multimedia Applications (1998)

To Appear, Richard Muntz, Jose Renato Santos, Steven Berson

We describe the design and implementation of the RIO (Randomized I/O) multimedia object server which manages a set of parallel disks and supports real-time throughput and statistical delay...

Static Analysis to Identify Invariants in RSML Specifications (1998)

To Appear, Jens U. Skakkebaek, David L. Dill

. Static analysis of formal, high-level specifications of safety critical software can discover flaws in the specification that would escape conventional syntactic and semantic analysis. As an...

Unconditional Transfer in Regulated Rewriting (1997)

To Appear, Henning Fernau

. In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed grammars, matrix grammars, grammars with regular control, grammars...

Probabilistic Roadm (1997)

To Appear, Lydia E. Kavraki, Jean-claude Latombe, Mark H. Overmars

A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is...

On Commoner's Liveness Theorem and Supervisory Policies that Enforce Liveness in Free-Choice Petri Nets (1997)

To Appear, Ramavarapu S. Sreenivas

A Petri net (PN) [3, 5] is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. A Free-Choice Petri net (FCPN) is a PN where...

Temporal Verification by Diagram Transformations (1996)

To Appear, Luca De Alfaro, Zohar Manna

. This paper presents a methodology for the verification of temporal properties of systems based on the gradual construction and algorithmic checking of fairness diagrams. Fairness diagrams...

Measurement of Language Supported Reuse in Object Oriented and Object Based Software (1995)

To Appear, James M. Bieman, Santhi Karunanithi

A major benefit of object oriented software development is the support for reuse provided by object oriented and object based languages. Yet, measures and measurement tools that quantify such...

Cost-Effective Parallel Computing (1995)

To Appear, David A. Wood, Mark D. Hill

Many academic papers imply that parallel computing is only worthwhile when applications achieve nearly linear speedup (i.e., execute nearly p times faster on p processors). This note shows that...

Towards a Duration Calculus Proof Assistant in PVS (1994)

To Appear, Jens Ulrik Skakkebaek, Natarajan Shankar

. The Duration Calculus (DC) is an interval temporal logic for reasoning about real-time systems. This paper describes a tool for constructing DC specifications and checking DC proofs. The proof...

A Comparison of Two Distributed Systems: Amoeba and Sprite (1991)

To Appear, Fred Douglis, M. Frans Kaashoek, John K. Ousterhout, Andrew S. Tanenbaum

This paper compares two distributed operating systems, Amoeba and Sprite. Although the systems share many goals, they diverged on two philosophical grounds: whether to emphasize a distributed...

A Comparison of Two Distributed Systems: Amoeba and Sprite (1991)

To Appear, Fred Douglis, M. Frans Kaashoek, John K. Ousterhout, Andrew S. Tanenbaum

This paper compares two distributed operating systems, Amoeba and Sprite. Although the systems share many goals, they diverged on two philosophical grounds: whether to emphasize a distributed...