336 search results - page 51 / 68 » Approximating Transitivity in Directed Networks |
80
Voted
STOC
2004
ACM
16 years 23 days ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
105
Voted
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
115
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Voice over IP (VoIP) speech quality estimation is crucial to providing optimal Quality of Service (QoS). This paper seeks to provide improved speech quality estimation models with...
91
Voted
WWW
2003
ACM
16 years 1 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
UIST
2005
ACM
15 years 6 months ago
2005
ACM
Informal prototyping tools have shown great potential in facilitating the early stage design of user interfaces. However, continuous interactions, an important constituent of high...