Sciweavers

1591 search results - page 44 / 319
» Associating network flows with user and application informat...
Sort
View
EJC
2011
13 years 3 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
14 years 5 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
ACSAC
1998
IEEE
14 years 23 days ago
Concentric Supervision of Security Applications: A New Security Management Paradigm
This paper questions the status quo regarding Security Management (SM) tools that function in an isolated, monolithic fashion. People work best by interacting with others and with...
P. C. Hyland, Ravi S. Sandhu
MM
2006
ACM
181views Multimedia» more  MM 2006»
14 years 2 months ago
Peer-to-peer multimedia applications
In both academia and industry, peer-to-peer (P2P) applications have attracted great attention. Peer-to-peer file sharing applications, such as Napster, Gnutella, Kazaa, BitTorrent...
Jin Li
MONET
2006
97views more  MONET 2006»
13 years 8 months ago
Pre-Reply Probe and Route Request Tail: Approaches for Calculation of Intra-Flow Contention in Multihop Wireless Networks
Several applications have been envisioned for multihop wireless networks that require different qualities of service from the network. In order to support such applications, the n...
Kimaya Sanzgiri, Ian D. Chakeres, Elizabeth M. Bel...