Sciweavers

498 search results - page 83 / 100
» A Theory of Complexity for Continuous Time Systems
Sort
View
SPAA
2010
ACM
14 years 5 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
MMMACNS
2001
Springer
13 years 11 months ago
Typed MSR: Syntax and Examples
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
Iliano Cervesato
ICDT
2010
ACM
194views Database» more  ICDT 2010»
13 years 9 months ago
Bag Equivalence of XPath Queries
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
Sara Cohen, Yaacov Y. Weiss
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 5 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
CHI
2008
ACM
14 years 7 months ago
Articulating common ground in cooperative work: content and process
We study the development of common ground in an emergency management planning task. Twelve three-person multi-role teams performed the task with a paper prototype in a controlled ...
Gregorio Convertino, Helena M. Mentis, Mary Beth R...