Sciweavers

1736 search results - page 173 / 348
» The rank-width of Directed Graphs
Sort
View
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
16 years 5 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 4 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
BMCBI
2006
199views more  BMCBI 2006»
15 years 4 months ago
PageMan: An interactive ontology tool to generate, display, and annotate overview graphs for profiling experiments
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
Björn Usadel, Axel Nagel, Dirk Steinhauser, Y...
LEGE
2004
103views Education» more  LEGE 2004»
15 years 6 months ago
Structuring and merging Distributed Content
A flexible approach for structuring and merging distributed learning object is presented. At the basis of this approach there is a formal representation of a learning object, call...
Luca Stefanutti, Dietrich Albert, Cord Hockemeyer
EJC
2008
15 years 4 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen