327 search results - page 50 / 66 » A Theory of Information-Flow Labels |
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
ICAPR
2005
Springer
15 years 3 months ago
2005
Springer
There is need for more formal specification of recognition tasks. Currently, it is common to use labeled training samples to illustrate the task to be performed. The mathematical ...
112
Voted
LAMAS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Multi-agent systems (MASs) is an area of distributed artificial intelligence that emphasizes the joint behaviors of agents with some degree of autonomy and the complexiti...
MM
2004
ACM
15 years 3 months ago
2004
ACM
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
PODC
2003
ACM
15 years 2 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...