813 search results - page 23 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
HT
1991
ACM
14 years 16 days ago
1991
ACM
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
IJCAI
1997
13 years 10 months ago
1997
Marco Gori Dipartimento di Ingegneria deU'Informazione Universita di Siena Via Roma 56 53100 Siena, Italy Alessandro Sperduti Dipartimento di Informatica Universita di Pisa C...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
ICDM
2006
IEEE
14 years 3 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
JEI
2006
13 years 9 months ago
2006
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...