Sciweavers

2612 search results - page 363 / 523
» Switching Graphs and Their Complexity
Sort
View
HT
1991
ACM
15 years 8 months ago
Identifying Aggregates in Hypertext Structures
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...
Rodrigo A. Botafogo, Ben Shneiderman
FASE
2010
Springer
15 years 7 months ago
Incremental Service Composition Based on Partial Matching of Visual Contracts
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
Muhammad Naeem, Reiko Heckel, Fernando Orejas, Fra...
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 6 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
ACSW
2006
15 years 5 months ago
Simulating a computational grid with networked animat agents
Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours o...
Kenneth A. Hawick, Heath A. James
UAI
2001
15 years 5 months ago
Improved learning of Bayesian networks
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
Tomás Kocka, Robert Castelo