Sciweavers

2412 search results - page 63 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
104
Voted
FSTTCS
1994
Springer
15 years 6 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
92
Voted
IRI
2007
IEEE
15 years 8 months ago
MAGIC: A Multi-Activity Graph Index for Activity Detection
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
Massimiliano Albanese, Andrea Pugliese, V. S. Subr...
DSP
2006
15 years 2 months ago
Matrix pencil method for simultaneously estimating azimuth and elevation angles of arrival along with the frequency of the incom
In this paper we describe a method for simultaneously estimating the direction of arrival (DOA) of the signal along with its unknown frequency. In a typical DOA estimation problem...
Nuri Yilmazer, Raul Fernandez-Recio, Tapan K. Sark...
IANDC
2008
122views more  IANDC 2008»
15 years 2 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
AAAI
1994
15 years 3 months ago
Experience-Aided Diagnosis for Complex Devices
This paper presents a novel approach to diagnosis which addresses the two problems - computational complexity of abduction and device models - that have prevented model-based diag...
Michel P. Féret, Janice I. Glasgow