1090 search results - page 194 / 218 » Priority Algorithms for Graph Optimization Problems |
PERCOM
2010
ACM
13 years 6 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
SPAA
1999
ACM
13 years 12 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
BMCBI
2006
13 years 7 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...