1830 search results - page 258 / 366 » Workshop on Graph Computation Models |
150
click to vote
AGTIVE
2003
Springer
15 years 10 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
146
Voted
ICALP
1990
Springer
15 years 9 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
170
click to vote
CCS
2008
ACM
15 years 7 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
129
click to vote
CUZA
2002
15 years 4 months ago
2002
Metacomputing allows the exploitation of geographically seperate, heterogenous networks and resources. Most metacomputers are feature rich and carry a long, complicated installati...
134
click to vote
LREC
2008
15 years 6 months ago
2008
A core ontology is a mid-level ontology which bridges the gap between an upper ontology and a domain ontology. Automatic Chinese core ontology construction can help quickly model ...