Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 3 of 3
Full-Text Articles in Computer Engineering
The End-To-End Argument And Application Design: The Role Of Trust, David D. Clark, Marjory S. Blumenthal
The End-To-End Argument And Application Design: The Role Of Trust, David D. Clark, Marjory S. Blumenthal
Federal Communications Law Journal
Symposium: Rough Consensus and Running Code: Integrating Engineering Principles into Internet Policy Debates, held at the University of Pennsylvania's Center for Technology Innovation and Competition on May 6-7, 2010.
Policy debates about the evolution of the Internet show varying degrees of understanding about the underlying technology. A fundamental principle of the design of the Internet, from the early 1980s, is the so-called "end-to-end argument" articulated in a seminal technical paper. Intended to provide guidance for what kind of capability is built into a network as opposed to the devices that use the network, the end-to-end argument has been invoked in …
Rough Consensus And Running Code: Integrating Engineering Principles Into Internet Policy Debates, Christopher S. Yoo
Rough Consensus And Running Code: Integrating Engineering Principles Into Internet Policy Debates, Christopher S. Yoo
Federal Communications Law Journal
Symposium: Rough Consensus and Running Code: Integrating Engineering Principles into Internet Policy Debates, held at the University of Pennsylvania's Center for Technology Innovation and Competition on May 6-7, 2010.
Parallelizing Scale Invariant Feature Transform On A Distributed Memory Cluster, Stanislav Bobovych
Parallelizing Scale Invariant Feature Transform On A Distributed Memory Cluster, Stanislav Bobovych
Inquiry: The University of Arkansas Undergraduate Research Journal
Scale Invariant Feature Transform (SIFT) is a computer vision algorithm that is widely-used to extract features from images. We explored accelerating an existing implementation of this algorithm with message passing in order to analyze large data sets. We successfully tested two approaches to data decomposition in order to parallelize SIFT on a distributed memory cluster.