Sciweavers

3598 search results - page 324 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
AAAI
2000
15 years 8 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
COMCOM
2006
98views more  COMCOM 2006»
15 years 6 months ago
On the fairness of dynamic bandwidth allocation schemes in Ethernet passive optical networks
Ethernet passive optical networks (EPONs) technology has emerged as a promising candidate for next-generation broadband access networks. As this technology evolves, the developmen...
Xiaofeng Bai, Abdallah Shami, Chadi Assi
MICCAI
2009
Springer
16 years 8 months ago
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategi...
Ayelet Akselrod-Ballin, Davi Bock, R. Clay Reid,...
WAE
1998
118views Algorithms» more  WAE 1998»
15 years 8 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
TCS
2010
15 years 1 months ago
Window-games between TCP flows
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
Pavlos S. Efraimidis, Lazaros Tsavlidis, George B....