Sciweavers

327 search results - page 11 / 66
» A Theory of Information-Flow Labels
Sort
View
COMBINATORICA
2011
13 years 9 months ago
Binary subtrees with few labeled paths
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
ICCV
2005
IEEE
15 years 11 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
IFIP
2010
Springer
14 years 4 months ago
A Calculus for the Analysis of Wireless Network Security Protocols
We propose a timed broadcasting calculus for wireless systems. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled ...
Francesco Ballardin, Massimo Merro
65
Voted
EGOV
2003
Springer
15 years 2 months ago
Local Democracy Shaping e-Democracy
This paper offers a fresh perspective to study the role and implications of information and communications technologies (ICT) in processes of local democracy. It moves away from ea...
Zahid Parvez
KES
2008
Springer
14 years 9 months ago
Information Coordination Using Meta-agents in Information Logistics Processes
In order to coordinate and deliver information in the right time and to the right place, theories from multi-agent systems and information logistics are combined. We use agents to ...
Mats Apelkrans, Anne Håkansson