2294 search results - page 215 / 459 » From Path Graphs to Directed Path Graphs |
126
click to vote
CCCG
2009
15 years 4 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
141
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
136
click to vote
AAAI
2011
14 years 2 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
111
click to vote
SODA
2010
ACM
16 years 9 days ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
139
Voted
IWIA
2005
IEEE
15 years 8 months ago
2005
IEEE
Intrusion detection systems alert the system administrators of intrusions but, in most cases, do not provide details about which system events are relevant to the intrusion and ho...