227 search results - page 41 / 46 » Complexity Results for Compressing Optimal Paths |
110
click to vote
IWQOS
2001
Springer
15 years 3 months ago
2001
Springer
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
ACCV
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
CGO
2008
IEEE
15 years 1 months ago
2008
IEEE
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
ICIW
2009
IEEE
15 years 5 months ago
2009
IEEE
We describe QoSMap, an overlay construction mechanism which computes high quality overlay networks for applications having stringent constraints on hop-degrading QoS metrics and p...
ICCAD
2005
IEEE
15 years 8 months ago
2005
IEEE
— Although the LUT (look-up table) size of FPGAs has been optimized for general applications, complicated designs may contain a large number of cascaded LUTs between flip-flops...