1722 search results - page 239 / 345 » Variables in Concept Graphs |
134
click to vote
ASPDAC
2001
ACM
15 years 8 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
161
click to vote
CCS
2008
ACM
15 years 6 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...
142
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
123
click to vote
LREC
2008
15 years 5 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 ...
131
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...