1629 search results - page 190 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
VISUALIZATION
2003
IEEE
15 years 3 months ago
2003
IEEE
Efficient and effective visual presentation of tensor fields is an ongoing research topic in scientific visualization. HyperLIC is a powerful method to visualize 2D and 3D tensor ...
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
LCPC
1994
Springer
15 years 2 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
119
Voted
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
105
click to vote
SASO
2010
IEEE
14 years 8 months ago
2010
IEEE
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...