58 search results - page 6 / 12 » cg 2008 |
123
Voted
DM
1998
15 years 3 months ago
1998
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
111
Voted
TSMC
1998
15 years 3 months ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
152
Voted
TMI
1998
15 years 3 months ago
1998
Abstract— The adaptive contrast enhancement (ACE) algorithm, which uses contrast gains (CG’s) to adjust the highfrequency components of images, is a well-known technique for me...
127
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
119
Voted
CG
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...