Sciweavers

1071 search results - page 156 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
14 years 1 months ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
SWS
2004
ACM
14 years 1 months ago
Applying hierarchical and role-based access control to XML documents
W3C Recommendations XML Encryption and XML-Digital Signature can be used to protect the confidentiality of and provide assurances about the integrity of XML documents transmitted...
Jason Crampton
DNA
2003
Springer
122views Bioinformatics» more  DNA 2003»
14 years 1 months ago
Self-Assembled Circuit Patterns
Abstract. Self-assembly is a process in which basic units aggregate under attractive forces to form larger compound structures. Recent theoretical work has shown that pseudo-crysta...
Matthew Cook, Paul W. K. Rothemund, Erik Winfree
SPAA
2010
ACM
14 years 29 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