Browsing Mathematics and Computer Science by Title
Now showing items 816 of 16

"Hierarchical routing in sensor networks using κdominating sets "
(SpringerVerlag, 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 kSPR sets. Such a set can serve as a ... 
"Inertia of the stein transformation with respect to some nonderogatory matrices"
(Elsevier Science, 199607)Let A be an nbyn 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 ′ + ′ + ... 
LIPS: Learning based indoor positioning system using mobile phonebased sensors
(201601)In this paper we investigate the problem of localizing a mobile device based on readings from its sensors utilizing machine learning methodologies. We consider a real world environment, collect a dense set of 3110 datapoints, ... 
Low Complexity AllOptical Network Coder Architecture
(ICNC, 201402)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
(MICS, 201404)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
(201209)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 pgroups of maximal class"
(Elsevier Science, 20040715)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 AllOptical Network Topology Design
(PDCS, 201011)In this paper, we consider the problem of topology design for both unprotected and onelink protected alloptical networks. We investigate the problem of selecting switching sites to minimize total cost of the network. The ... 
VideoBased Instruction For Introductory Computer Programming
(CCSC, 201405)Video replacement of inperson 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. ...