1127 search results - page 68 / 226 » Testing the Expansion of a Graph |
TREC
2004
14 years 11 months ago
2004
With our participation in TREC2004, we test Terrier, a modular and scalable Information Retrieval framework, in three tracks. For the mixed query task of the Web track, we employ ...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known ...
ESA
1993
Springer
15 years 1 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...