3220 search results - page 617 / 644 » Constrained Graph Processes |
WWW
2006
ACM
15 years 10 months ago
2006
ACM
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
WWW
2003
ACM
15 years 10 months ago
2003
ACM
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
122
click to vote
WWW
2002
ACM
15 years 10 months ago
2002
ACM
Real-scale Semantic Web applications, such as Knowledge Portals and E-Marketplaces, require the managementof large volumes of metadata, i.e., information describing the available ...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
115
click to vote
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...