2542 search results - page 101 / 509 » Computing Cartograms with Optimal Complexity |
138
click to vote
AINA
2008
IEEE
15 years 9 months ago
2008
IEEE
With quick evolution of grid technologies and increasing complexity of e-Science applications, reasoning temporal properties of grid workflows to ensure reliability and trustworth...
159
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
118
Voted
WG
1998
Springer
15 years 7 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
115
Voted
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
139
click to vote
ICVS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Experimenting and building integrated, operational systems in computational vision poses both theoretical and practical challenges, involving methodologies from control t...