Results 1 
7 of
7
The Quickhull algorithm for convex hulls
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1996
"... The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental algo ..."
Abstract

Cited by 456 (0 self)
 Add to MetaCart
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the twodimensional Quickhull Algorithm with the generaldimension BeneathBeyond Algorithm. It is similar to the randomized, incremental algorithms for convex hull and Delaunay triangulation. We provide empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it uses less memory. Computational geometry algorithms have traditionally assumed that input sets are well behaved. When an algorithm is implemented with floatingpoint arithmetic, this assumption can lead to serious errors. We briefly describe a solution to this problem when computing the convex hull in two, three, or four dimensions. The output is a set of “thick ” facets that contain all possible exact convex hulls of the input. A variation is effective in five or more dimensions.
Forward Acknowledgment: Refining TCP Congestion Control
 In Proceedings of the ACM SIGCOMM
, 1996
"... ing with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permission to publish from: Publications Dept. ACM, Inc. Fax +1 212 869 0481 or email !permissions@acm.org?. Abstract We have d ..."
Abstract

Cited by 149 (4 self)
 Add to MetaCart
ing with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permission to publish from: Publications Dept. ACM, Inc. Fax +1 212 869 0481 or email !permissions@acm.org?. Abstract We have developed a Forward Acknowledgment (FACK) congestion control algorithm which addresses many of the performance problems recently observed in the Internet. The FACK algorithm is based on first principles of congestion control and is designed to be used with the proposed TCP SACK option. By decoupling congestion control from other algorithms such as data recovery, it attains more precise control over the data flow in the network. We introduce two additional algorithms to improve the behavior in specific situations. Through simulations we compare FACK to both Reno and Reno with SACK. Finally, we consider the potential performance and impact of FACK in the Internet. 1 Introduction The evolution...
Resource Partitioning for Realtime Communication
 IEEE/ACM Transactions on Networking
, 1993
"... We investigate the network resource partitioning problem for realtime communication. Resource partitioning is useful for a number of applications, including virtual private subnetworks, advance reservation of realtime network services, fast establishment of realtime connections and support for ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
We investigate the network resource partitioning problem for realtime communication. Resource partitioning is useful for a number of applications, including virtual private subnetworks, advance reservation of realtime network services, fast establishment of realtime connections and support for mobile computing with realtime communication. We propose a scheme where resource partitioning requires extra computation only at the connection establishment time and where the perpacket scheduling and rate control does not require any extra work for supporting resource partitioning. June 7, 1993 ############### Acknowledgements: This research was supported by the National Science Foundation and the Defense Advanced Research Projects Agency (DARPA) under Cooperative Agreement NCR8919038 with the Corporation for National Research Initiatives, by AT&T Bell Laboratories, Hitachi, Ltd., Hitachi America, Ltd., Pacific Bell, the University of California under a MICRO grant, and the In...
Parallel networks for machine vision
 MIT AI Memo
, 1988
"... The amount of computation required to solve many early vision problems is prodigious, and so it has long been thought that systems that operate in a reasonable amount of time will only become feasible when parallel systems become available. Such systems now exist in digital form, but most are large ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
The amount of computation required to solve many early vision problems is prodigious, and so it has long been thought that systems that operate in a reasonable amount of time will only become feasible when parallel systems become available. Such systems now exist in digital form, but most are large and expensive. These machines constitute an invaluable testbed for the development of new algorithms, but they can probably not be scaled down rapidly in both physical size and cost, despite continued advances in semiconductor technology and machine architecture. Simple analog networks can perform interesting computations, as has been known for a long time. We have reached the point where it is feasible to experiment with implementation of these idea in VLSI form, particularly if we focus on networks composed of locally interconnected passive elements, linear amplifiers, and simple nonlinear components. While there have been excursions into the development of ideas in this area since the very beginnings of work on machine vision, much work remains to be done. Progress will depend on careful attention to matching of the capabilities of simple networks to the needs of early vision. Note that this is not at all intended to be anything like a review of the field, but merely a collection of some ideas that seem to be interesting. See also pp 531573,
{\it Artificial Intelligence at MIT: Expanding Frontiers},
edited by Patrick H. Winston and Sarah A. Shellard,
MIT Press.
Basic Science for Software Developers
"... This paper has illustrated why, a course on these topics should be required as part of the basic science component of a programme for engineers specialising in software intensive products ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper has illustrated why, a course on these topics should be required as part of the basic science component of a programme for engineers specialising in software intensive products
Quantum Law of Motion: Analysis and Extension to Higher Dimensions
, 2008
"... In this paper, we review the recently formulated quantum laws of motion and provide new observations. We also extend these laws to higher dimensions. By applying in two dimensions the obtained relations to charge submitted to an electric central potential, we decide between these laws. Furthermore, ..."
Abstract
 Add to MetaCart
In this paper, we review the recently formulated quantum laws of motion and provide new observations. We also extend these laws to higher dimensions. By applying in two dimensions the obtained relations to charge submitted to an electric central potential, we decide between these laws. Furthermore, we extend the selected law to the relativistic case in higher dimensions. PACS: 03.65.Ca; 03.65.Ta; 04.20.q Key words: quantum law of motion, quantum potential, higher dimensions,