Sciweavers

446 search results - page 66 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
NOMS
2008
IEEE
14 years 1 months ago
Towards SLA-based optimal workload distribution in SANs
—Storage Area Networks (SANs) connect storage devices to servers over fast network interconnects. We consider the problem of optimal SAN configuration with the goal of meeting s...
Eray Gencay, Carsten Sinz, Wolfgang Küchlin
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 8 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
CONEXT
2008
ACM
13 years 9 months ago
Adapting TFRC to mobile networks with frequent disconnections
In the context of mobile and pervasive networking, it is not uncommon to experience frequent loss of connectivity. Congestion control algorithms usually mistake resulting packets ...
Olivier Mehani, Roksana Boreli
MOBICOM
2012
ACM
11 years 10 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
ICIP
2008
IEEE
14 years 9 months ago
Image retrieval and classification using associative reciprocal-image attractors
In this paper, image processing and symbol processing are bridged with a common framework. A new computational architecture allows arbitrary fixed images to be used as attractors ...
Douglas S. Greer, Mihran Tuceryan