Sciweavers

2612 search results - page 298 / 523
» Assemblies as Graph Processes
Sort
View
IDEAS
2000
IEEE
117views Database» more  IDEAS 2000»
15 years 11 months ago
Path Query Reduction and Diffusion for Distributed Semi-Structured Data Retrieval
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...
Jaehyung Lee, Yon Dohn Chung, Myoung-Ho Kim
EUROMICRO
1996
IEEE
15 years 10 months ago
Efficient Program Composition on Parix by the Ensemble Methodology
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
John Yiannis Cotronis
DSN
2006
IEEE
16 years 19 days ago
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
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...
Antonio Fernández, Ernesto Jiménez, ...
CVPR
2001
IEEE
16 years 8 months ago
Understanding Popout through Repulsion
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...
Stella X. Yu, Jianbo Shi
WWW
2009
ACM
16 years 7 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...