12194 search results - page 51 / 2439 » cans 2010 |
89
Voted
DBSEC
2010
15 years 2 months ago
2010
Abstract. In considering a problem in access control for scalable multimedia formats, we have developed new methods for constructing a key assignment scheme. Our first contribution...
115
Voted
ENTCS
2007
15 years 16 days ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
116
Voted
Publication
We present a method for detecting and describing features in vector flow fields. Our method models flow fields locally using a linear combination of complex monomials. These monomi...
ALT
2010
Springer
15 years 2 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
90
Voted
NETWORKS
2010
14 years 11 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.