Sciweavers

486 search results - page 44 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
ICDAR
2003
IEEE
14 years 1 months ago
Automatic Discovery of Semantic Structures in HTML Documents
Template-driven HTML documents posses an implicit, fixed schema denoting concepts and their relationships in a hierarchical fashion. Discovering this schema remains a relatively ...
Saikat Mukherjee, Guizhen Yang, Wenfang Tan, I. V....
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
13 years 12 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
DAM
2010
137views more  DAM 2010»
13 years 7 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
SPIN
2004
Springer
14 years 1 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
FGCS
2010
129views more  FGCS 2010»
13 years 6 months ago
Bulk synchronous parallel ML with exceptions
Bulk Synchronous Parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementa...
Louis Gesbert, Frédéric Gava, Fr&eac...