Sciweavers

1336 search results - page 61 / 268
» SMTP Path Analysis
Sort
View
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 9 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
DEBU
2007
111views more  DEBU 2007»
13 years 9 months ago
Multi-lingual Semantic Matching with OrdPath in Relational Systems
The volume of information in natural languages in electronic format is increasing exponentially. The demographics of users of information management systems are becoming increasin...
A. Kumaran, Peter Carlin
ADHOC
2010
173views more  ADHOC 2010»
13 years 5 months ago
A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation
Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors wit...
Harish Sethu, Thomas Gerety
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 2 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
CHI
2011
ACM
13 years 19 days ago
Feedlack detects missing feedback in web applications
While usability methods such as user studies and inspections can reveal a wide range of problems, they do so for only a subset of an application’s features and states. We presen...
Andrew J. Ko, Xing Zhang