505 search results - page 40 / 101 » On A Graph Formalism for Ordered Edges |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
MCPR2
2011
14 years 17 days ago
2011
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...
RSA
2011
14 years 4 months ago
2011
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
177
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...