3220 search results - page 376 / 644 » Constrained Graph Processes |
174
click to vote
DOCENG
2003
ACM
15 years 11 months ago
2003
ACM
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
197
click to vote
IDEAS
2000
IEEE
15 years 11 months ago
2000
IEEE
I n this paper, we address the problem of query processing o n distributed semi-structured data. The distributed semistructured data can be modeled as a rooted and edge-labeled gr...
174
click to vote
EUROMICRO
1996
IEEE
15 years 10 months ago
1996
IEEE
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
187
click to vote
DSN
2006
IEEE
16 years 18 days ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
203
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...