• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,514
Next 10 →

Optimization Flow Control, I: Basic Algorithm and Convergence

by Steven H. Low, David E. Lapsley - IEEE/ACM TRANSACTIONS ON NETWORKING , 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract - Cited by 694 (64 self) - Add to MetaCart
at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment.

Serverless Network File Systems

by Thomas E. Anderson, Michael D. Dahlin, Jeanna M. Neefe, David A. Patterson, Drew S. Roselli, Randolph Y. Wang - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1995
"... In this paper, we propose a new paradigm for network file system design, serverless network file systems. While traditional network file systems rely on a central server machine, a serverless system utilizes workstations cooperating as peers to provide all file system services. Any machine in the sy ..."
Abstract - Cited by 473 (28 self) - Add to MetaCart
failed component, our serverless design also provides high availability via redundant data storage. To demonstrate our approach, we have implemented a prototype serverless network file system called xFS. Preliminary performance measurements suggest that our architecture achieves its goal of scalability

Safe Kernel Extensions Without Run-Time Checking

by George C. Necula, Peter Lee - Proc. of OSDI'96
"... Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a safety policy and makes it public. Then, using this policy, an application can provide binaries i ..."
Abstract - Cited by 429 (20 self) - Add to MetaCart
. If the validation succeeds, the code is guaranteed to respect the safety policy without relying on run-time checks. The main practical difficulty of PCC is in generating the safety proofs. In order to gain some preliminary experience with this, we have written several network packet filters in hand-tuned DEC Alpha

Garp: A MIPS Processor with a Reconfigurable Coprocessor

by John R. Hauser , John Wawrzynek , 1997
"... Typical reconfigurable machines exhibit shortcomings that make them less than ideal for general-purpose computing. The Garp Architecture combines reconfigurable hardware with a standard MIPS processor on the same die to retain the better features of both. Novel aspects of the architecture are presen ..."
Abstract - Cited by 404 (7 self) - Add to MetaCart
are presented, as well as a prototype software environment and preliminary performance results. Compared to an UltraSPARC, a Garp of similar technology could achieve speedups ranging from a factor of 2 to as high as a factor of 24 for some useful applications.

FAST TCP: Motivation, Architecture, Algorithms, Performance

by C. Jin, D. X. Wei, S. H. Low , 2004
"... We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties, at both packet and flow levels, which the current TCP implementation has at large windows. W ..."
Abstract - Cited by 369 (18 self) - Add to MetaCart
. We describe the architecture and characterize the equilibrium and stability properties of FAST TCP. We present experimental results comparing our first Linux prototype with TCP Reno, HSTCP, and STCP in terms of throughput, fairness, stability, and responsiveness. FAST TCP aims to rapidly stabilize

prototyping;

by Rahul Nair
"... As recording technology becomes pervasive there is a dramatic increase in the number of events being recorded in multimedia. The challenge now facing users is to quickly view the recorded content in the least amount of time. While there are several methods to analyze video based on ambient noise, sc ..."
Abstract - Add to MetaCart
of a preliminary evaluation of the LOI function are also presented along with the design of an LOI based video browser.

Trio: a system for integrated management of data, accuracy, and lineage

by Jennifer Widom - PRESENTED AT CIDR 2005 , 2005
"... Trio is a new database system that manages not only data, butalsotheaccuracy and lineage of the data. Inexact (uncertain, probabilistic, fuzzy, approximate, incomplete, and imprecise!) databases have been proposed in the past, and the lineage problem also has been studied. The goals of the Trio proj ..."
Abstract - Cited by 268 (17 self) - Add to MetaCart
. This paper provides numerous motivating applications for Trio and lays out preliminary plans for the data model, query language, and prototype system.

Linear Object Classes and Image Synthesis From a Single Example Image

by Thomas Vetter, Tomaso Poggio - IEEE Transactions on Pattern Analysis and Machine Intelligence , 1997
"... Abstract—The need to generate new views of a 3D object from a single real image arises in several fields, including graphics and object recognition. While the traditional approach relies on the use of 3D models, we have recently introduced [1], [2], [3] simpler techniques that are applicable under r ..."
Abstract - Cited by 235 (25 self) - Add to MetaCart
and Vetter. For linear object classes, it is shown that linear transformations can be learned exactly from a basis set of 2D prototypical views. We demonstrate the approach on artificial objects and then show preliminary evidence that the technique can effectively “rotate ” highresolution face images from a

Measuring Link Bandwidths Using a Deterministic Model of Packet Delay

by Kevin Lai, Mary Baker - in Proceedings of ACM SIGCOMM , 2000
"... We describe a deterministic model of packet delay and use it to derive both the packet pair [2] property of FIFO-queueing networks and a new technique (packet tailgating) for actively measuring link bandwidths. Compared to previously known techniques, packet tailgating usually consumes less network ..."
Abstract - Cited by 223 (3 self) - Add to MetaCart
bandwidth, does not rely on consistent behavior of routers handling ICMP packets, and does not rely on timely delivery of acknowledgments. Preliminary empirical measurements in the Internet indicate that compared to current measurement tools, packet tailgating sends an order of magnitude fewer packets

A Prototype Hand Geometry-based Verification System

by Arun Ross , 1999
"... Geometric measurements of the human hand have been used for identity authentication in a number of commercial systems. In this project we have developed a protoype hand geometry-based verification system and analyzed it's performance. We have demonstrated the practical utility of this system by ..."
Abstract - Cited by 105 (8 self) - Add to MetaCart
by designing an application that uses hand geometry as opposed to password for restricting access to a web site. We present our preliminary verification results based on hand measurements of 50 individuals captured over a period of time.
Next 10 →
Results 1 - 10 of 2,514
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University