Browse Research and Tech Reports - Computer Science by Subject "algorithms"

  • Conner, William G.; Nahrstedt, Klara (2008-07)
    As Internet telephony systems continue to replace existing Public Switched Telephone Network systems, proxy servers running the Session Initiation Protocol (SIP) will continue to grow in importance for Voice-over-IP ...

    application/pdf

    application/pdfPDF (102Kb)
  • Pae, Sung-il (2005-05)
    We study random number generation using a biased source motivated by previous works on this topic, mainly, von Neumman (1951), Elias (1972), Knuth and Yao (1976) and Peres (1992). We study the problem in two cases: first, ...

    application/pdf

    application/pdfPDF (500Kb)
  • Cheng, Peng (2005-08)
    Kinodynamic and nonholonomic planning problems have differential constraints which restrict admissible velocities and accelerations of robotic systems. Since these differential constraints are ignored in the path planning ...

    application/pdf

    application/pdfPDF (2Mb)
  • Bunde, David Pattison (2006-07)
    We present algorithms and hardness results for three resource allocation problems. The first is an abstract admission control problem where the system receives a series of requests and wants to satisfy as many as possible, ...

    application/pdf

    application/pdfPDF (498Kb)
  • Cai, Deng; He, Xiaofei; Han, Jiawei (2007-05)
    Spectral methods have recently emerged as a powerful tool for dimensionality reduction and manifold learning. These methods use information contained in the eigenvectors of a data affinity (\ie, item-item similarity) matrix ...

    application/pdf

    application/pdfPDF (273Kb)
  • Cai, Deng; He, Xiaofei; Han, Jiawei (2007-05)
    Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection functions of LDA are commonly obtained by maximizing the between class covariance and ...

    application/pdf

    application/pdfPDF (249Kb)
  • Xue, Yuan; Cui, Yi; Nahrstedt, Klara (2005-06)
    Energy efficient routing is a critical problem in multihop wireless networks due to the severe power constraint of wireless nodes. Despite its importance and many research efforts towards it, a distributed routing algorithm ...

    application/pdf

    application/pdfPDF (159Kb)
  • Xue, Yuan; Cui, Yi; Nahrstedt, Klara (2006-04)
    Energy efficient routing is a critical problem in multihop wireless networks due to the severe power constraint of wireless nodes. Despite its importance and many research efforts towards it, a distributed routing algorithm ...

    application/pdf

    application/pdfPDF (164Kb)
  • VanderZee, Evan; Hirani, Anil N.; Guoy, Damrong; Ramos, Edgar (2008-02)
    Well-centered meshes (meshes composed of well-centered simplices) have the advantage of having nice orthogonal dual meshes (the dual Voronoi diagram), which is useful for certain numerical algorithms that require or prefer ...

    application/pdf

    application/pdfPDF (889Kb)
  • Lim, Hyuk; Kung, Lu-Chuan; Hou, Jennifer C.; Luo, Haiyun (2005-08)
    With the technical advances in ubiquitous computing and wireless networking, there has been an increasing need to capture the context information (such as the location) and to figure it into applications. In this paper, ...

    application/pdf

    application/pdfPDF (2Mb)