564 search results - page 56 / 113 » Some Results on the Expressive Power and Complexity of LSCs |
ESA
2007
Springer
15 years 4 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
USS
2008
15 years 4 days ago
2008
Automated bot/botnet detection is a difficult problem given the high level of attacker power. We propose a systematic approach for evaluating the evadability of detection methods....
CSFW
2004
IEEE
15 years 1 months ago
2004
IEEE
We study the specification of access control policy in large-scale distributed systems. We present Cassandra, a language and system for expressing policy, and the results of a sub...
JACM
2000
14 years 9 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
PAKDD
2005
ACM
15 years 3 months ago
2005
ACM
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets ...