Sciweavers

28888 search results - page 300 / 5778
» Computability and complexity in analysis
Sort
View
TWC
2010
15 years 1 months ago
Robustness analysis and new hybrid algorithm of wideband source localization for acoustic sensor networks
Wideband source localization using acoustic sensor networks has been drawing a lot of research interest recently in wireless communication applications, such as cellular handset lo...
Kun Yan, Hsiao-Chun Wu, S. Sitharama Iyengar
JAR
1998
60views more  JAR 1998»
15 years 6 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
PODC
2009
ACM
16 years 1 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
ICECCS
1997
IEEE
102views Hardware» more  ICECCS 1997»
15 years 11 months ago
Problem complexity
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
Michael Jackson
ICCS
2005
Springer
16 years 5 days ago
Morphisms in Context
Abstract. Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms...
Markus Krötzsch, Pascal Hitzler, Guo-Qiang Zh...