Sciweavers

1695 search results - page 63 / 339
» Linear, Polynomial or Exponential
Sort
View
LICS
2005
IEEE
15 years 6 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
92
Voted
ICARIS
2009
Springer
15 years 4 months ago
Efficient Algorithms for String-Based Negative Selection
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
Michael Elberfeld, Johannes Textor
86
Voted
AAAI
1990
15 years 2 months ago
Physical Impossibility Instead of Fault Models
In this paper we describe the concept of physical impossibility as an alternative to the specification of fault models. These axioms can be used to exclude impossible diagnoses si...
Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
114
Voted
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 9 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
99
Voted
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 27 days ago
New Set of Codes for the Maximum-Likelihood Decoding Problem
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
Morgan Barbier