Now showing items 16678-16697 of 37378

    • "Distance Estimation and Object Location via Rings of Neighbors" 

      Slivkins, Aleksandrs (Cornell University, 2005-02-12)
      We approach several problems on distance estimation and object location using a common technique called \emph{rings of neighbors}. Using this technique on metrics of low doubling dimension, we obtain significant improvements ...
    • Distance Transforms of Sampled Functions 

      Felzenszwalb, Pedro; Huttenlocher, Daniel (Cornell University, 2004-09-01)
      This paper provides linear-time algorithms for solving a class of minimization problems involving a cost function with both local and spatial terms. These problems can be viewed as a generalization of classical distance ...
    • Distance Weighted Discrimination 

      Marron, J. S.; Todd, M. (Cornell University Operations Research and Industrial Engineering, 2002-07)
      Distance Weighted Discrimination
    • Distinctive Features of Output from Statistical Computing Packages for Linear Model Calculations on Unbalanced Data 

      Searle, S. R.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1981-08)
    • Distinguishing Between Feeding Human Milk At The Breast And From A Bottle 

      O'Sullivan, Elizabeth (2016-02-01)
      National breastfeeding surveillance questions in the U.S. ask solely about infant human milk (HM)-consumption, and not about mode of HM-feeding-at the breast or from a bottle. This is problematic because most HM-feeding ...
    • Distinguishing Carrot's Characteristics by Near Infrared (NIR) Reflectance and Multivariate Data Analysis 

      Abu-Khalaf, N.; Bennedsen, B.; Bjorn, G. (International Commission of Agricultural Engineering, 2004-03)
      This is a paper from International Commission of Agricultural Engineering (CIGR, Commission Internationale du Genie Rural) E-Journal Volume 6 (2004): N. Abu-Khalaf, B. Bennedsen and G. Bjorn. Distinguishing Carrot's ...
    • Distinguishing Criteria for Repeated Block Designs 

      Federer, W. T.; Lee, F.-C. H.; Raghavarao, D.; Seiden, E.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1978-12)
    • Distributed Agreement in the Presence of Processor and Communication Faults 

      Perry, Kenneth J.; Toueg, Sam (Cornell University, 1984-05)
      A model of distributed computation is proposed in which processes may fail by not sending or receiving the messages specified by a protocol. The solution to the Byzantine Generals Problem for this model is presented. Our ...
    • A Distributed Algorithm for Generalized Deadlock Detection 

      Bracha, Gabriel; Toueg, Sam (Cornell University, 1983-06)
      An efficient distributed algorithm to detect deadlocks in distributed and dynamically changing systems is presented. In our model, processes can request any $N$ available resources from a pool of size $M$. This is a ...
    • Distributed Blinding for ElGamal Re-encryption 

      Zhou, Lidong; Marsh, Michael A.; Schneider, Fred B.; Redz, Anna (Cornell University, 2004-01-06)
      A protocol is given that allows a set of n servers to cooperate and produce an ElGamal ciphertext encrypted under one key from an ElGamal ciphertext encrypted under another, but without plaintext ever becoming available. ...
    • Distributed Communication in ML 

      Hayden, Mark (Cornell University, 1997-11)
      We present our experience in implementing a group communication toolkit in Objective Caml, a dialect of the ML family of programming languages. We compare the toolkit both quantitatively and qualitatively to a predecessor ...
    • Distributed Constraint-based Location Discovery in Ad hoc Networks 

      Guha, Saikat; Sirer, Emin Gun (Cornell University, 2004-06-07)
      Location discovery is a fundamental building block for many mobile applications. Yet dedicated infrastructure for determining node locations is expensive, energy consuming, and simply unavailable under certain development ...
    • Distributed Cooperative Communication in Large-Scale Wireless Networks 

      Sirkeci, Birsen (2006-07-19)
      Cooperative communication employs distributed transmission resources at the physical layer as a single radio with spatial diversity in order to increase the performance of wireless networks. However, node cooperation ...
    • A Distributed Delay Model for Tuberculosis 

      Castillo-Chavez, Carlos; Feng, Zhilan; Capurro, Angel F.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1996-04)
    • A Distributed Digital Library of Mathematical Monographs - Website 

      Ruddy, David (2004)
      This is a PDF representation of a website that described and documented a digital library project carried out during 2001-2003. The project was funded by the National Science Foundation and the Deutsche Forschungsgemeinschaft. ...
    • Distributed ML: Abstractions for Efficient and Fault-Tolerant Programming 

      Krumvieda, Clifford Dale (Cornell University, 1993-08)
      Despite the availability, inherent parallelism, and potential fault tolerance of networked workstations and microcomputers, most programmers do not write distributed code. Those that do are often overwhelmed by the ...
    • Distributed Network Synchronization: The Internet And Electric Power Grids 

      Mallada, Enrique (2014-01-27)
      Synchronization is a fundamental requirement of most networked engineering applications. It enables the necessary coordination among agents required to implement several communication systems as well as network protocols. ...
    • A Distributed Path Algorithm and Its Correctness Proof 

      Wright, David D.; Schneider, Fred B. (Cornell University, 1983-06)
      A distributed program is developed to allow a process in a network to determine a path from itself to any other process, assuming that the topology of the entire network is not known to any process and that each process ...
    • Distributed Snapshots In Spite of Failures 

      Shah, Amitabh; Toueg, Sam (Cornell University, 1984-07)
      An extension of the Chandy-Lamport algorithm ([Chan84]) to find global states of distributed systems is presented where benign failures of processes and channels are permitted. The scope of the algorithm in detecting ...
    • A Distributed System For Large-Scale Geolocalization Of Internet Hosts 

      Caruso, Nicole (2011-01-31)
      Determining the geographic location of nodes enables a variety of useful network applications. Such applications include finding servers that are closest to clients, customizing content based on the location of website ...