Results 1 - 10 of 59,441

An algebraic approach to network coding

by Ralf Koetter, Muriel Médard - IEEE/ACM TRANSACTIONS ON NETWORKING , 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract - Cited by 858 (88 self) - Add to MetaCart
networks and robust networking. For networks which are restricted to using linear network codes, we find necessary and sufficient conditions for the feasibility of any given set of connections over a given network. We also consider the problem of network recovery for nonergodic link failures

Markov Logic Networks

by Matthew Richardson, Pedro Domingos - MACHINE LEARNING , 2006
"... We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract - Cited by 816 (39 self) - Add to MetaCart
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects

Network information flow

by Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung - IEEE TRANS. INFORM. THEORY , 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract - Cited by 1967 (24 self) - Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information

Mining the Network Value of Customers

by Pedro Domingos, Matt Richardson - In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining , 2002
"... One of the major applications of data mining is in helping companies determine which potential customers to market to. If the expected pro t from a customer is greater than the cost of marketing to her, the marketing action for that customer is executed. So far, work in this area has considered only ..."
Abstract - Cited by 568 (11 self) - Add to MetaCart
as a set of independent entities, we view it as a social network and model it as a Markov random eld. We show the advantages of this approach using a social network mined from a collaborative ltering database. Marketing that exploits the network value of customers|also known as viral marketing

Resilient Overlay Networks

by David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris , 2001
"... A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s wide-area routing protocols that take at least several minutes to recover. A R ..."
Abstract - Cited by 1160 (31 self) - Add to MetaCart
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s wide-area routing protocols that take at least several minutes to recover. A

Application of Phylogenetic Networks in Evolutionary Studies

by Daniel H. Huson, David Bryant - SUBMITTED TO MBE 2005 , 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract - Cited by 887 (15 self) - Add to MetaCart
both split networks and reticulate networks, how they are defined and how they can be interpreted. Additionally, the paper outlines the beginnings of a comprehensive statistical framework for applying split network methods. We show how split networks can represent confidence sets of trees and introduce

Timing-Sync Protocol for Sensor Networks

by Saurabh Ganeriwal, Ram Kumar, Mani B. Srivastava - The First ACM Conference on Embedded Networked Sensor System (SenSys , 2003
"... Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages that are ..."
Abstract - Cited by 515 (8 self) - Add to MetaCart
Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages

Neural Network-Based Face Detection

by Henry A. Rowley, Shumeet Baluja, Takeo Kanade - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1998
"... We present a neural network-based upright frontal face detection system. A retinally connected neural network examines small windows of an image and decides whether each window contains a face. The system arbitrates between multiple networks to improve performance over a single network. We present ..."
Abstract - Cited by 1206 (22 self) - Add to MetaCart
We present a neural network-based upright frontal face detection system. A retinally connected neural network examines small windows of an image and decides whether each window contains a face. The system arbitrates between multiple networks to improve performance over a single network. We present

Measurement and Analysis of Online Social Networks

by Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, Bobby Bhattacharjee - In Proceedings of the 5th ACM/USENIX Internet Measurement Conference (IMC’07 , 2007
"... Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity ..."
Abstract - Cited by 698 (14 self) - Add to MetaCart
of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network’s graph. Our data set contains over 11.3 million users

Protocols for self-organization of a wireless sensor network

by Katayoun Sohrabi, Jay Gao, Vishal Ailawadhi, Gregory J Pottie - IEEE Personal Communications , 2000
"... We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation ..."
Abstract - Cited by 536 (5 self) - Add to MetaCart
We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing
Results 1 - 10 of 59,441