Now showing items 8-15 of 15

  • "Hierarchical routing in sensor networks using κ-dominating sets " 

    Rieck, Michael Q.; Dhar, Subhankar (Springer-Verlag, 2005)
    For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a ...
  • "Inertia of the stein transformation with respect to some nonderogatory matrices" 

    DeAlba, Luz M. (Elsevier Science, 1996-07)
    Let A be an n-by-n nonderogatory matrix all of whose eigenvalues lie on the unit circle, and let and be nonnegative integers with + = n. Let ′ and ′ be positive integers and ′ a nonnegative integer with ′ + ′ + ...
  • Low Complexity All-Optical Network Coder Architecture 

    Manley, Eric D. (ICNC, 2014-02)
    Network coding, a networking paradigm in which different pieces of data are coded together at various points along a transmission, has been proposed for providing a number of benefits to networks including increased ...
  • Multicast Network Coded Flow In Grid Graphs 

    Manley, Eric D.; Gormley, John (MICS, 2014-04)
    Network coding, a relatively new paradigm for transmitting information through communication networks, allowing intermediate nodes in the network to combine data received on separate incoming channels before transmitting ...
  • On The Integral Coding Advantage In Unit Combination Networks 

    Manley, Eric D.; Holcomb, David; Grout, Jason; Hoyer, Alex (2012-09)
    Network coding is a networking paradigm which allows network nodes to combine different pieces of data at various steps in the transmission rather than simply copying and forwarding the data. Network coding has various ...
  • "On the Taketa bound for normally monomial p-groups of maximal class" 

    Keller, Thomas Michael; Ragan, Dustin; Tims, Geoffrey T. (Elsevier Science, 2004-07-15)
    A longstanding problem in the representation theory of finite solvable groups, sometimes called the Taketa problem, is to find strong bounds for the derived length dl(G) in terms of the number |cd(G)| of irreducible character ...
  • Selection Of Switching Sites In All-Optical Network Topology Design 

    Manley, Eric D.; Saha, Shivashis; Deogun, Jitender S. (PDCS, 2010-11)
    In this paper, we consider the problem of topology design for both unprotected and one-link protected all-optical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The ...
  • Video-Based Instruction For Introductory Computer Programming 

    Manley, Eric D.; Urness, Timothy (CCSC, 2014-05)
    Video replacement of in-­person lecture is finding its way into more and more computer science education settings such as inverted classrooms, massive open online courses, online/distance learning, and programming camps. ...