Sciweavers

9871 search results - page 25 / 1975
» On the Structure of Low Sets
Sort
View
FSTTCS
2004
Springer
14 years 1 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICCL
1998
IEEE
13 years 12 months ago
Breaking Abstractions and Unstructuring Data Structures
Christian S. Collberg, Clark D. Thomborson, Dougla...
CSL
2005
Springer
14 years 1 months ago
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
Bruno Courcelle, Christian Delhommé
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Mining protein loops using a structural alphabet and statistical exceptionality
Background: Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, ca...
Leslie Regad, Juliette Martin, Grégory Nuel...
DAC
2005
ACM
14 years 8 months ago
Hardware speech recognition for user interfaces in low cost, low power devices
We propose a system architecture for real-time hardware speech recognition on low-cost, power-constrained devices. The system is intended to support real-time speech-based user in...
Sergiu Nedevschi, Rabin K. Patra, Eric A. Brewer