31 search results - page 5 / 7 » cg 1998 |
CG
1998
Springer
13 years 11 months ago
1998
Springer
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
DM
1998
13 years 7 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) ...
TSMC
1998
13 years 7 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...
TMI
1998
13 years 7 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...
CG
1998
Springer
13 years 7 months ago
1998
Springer
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...