Sciweavers

1162 search results - page 101 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
RASC: Dynamic Rate Allocation for Distributed Stream Processing Applications
In today’s world, stream processing systems have become important, as applications like media broadcasting, sensor network monitoring and on-line data analysis increasingly rely...
Yannis Drougas, Vana Kalogeraki
ICHIT
2009
Springer
14 years 2 months ago
An efficient algorithm for AS path inferring
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
Guoqiang Yang, Wenhua Dou
IWCMC
2009
ACM
14 years 27 days ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck
COCOA
2007
Springer
14 years 2 months ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim
JEA
2008
88views more  JEA 2008»
13 years 8 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt