2490 search results - page 305 / 498 » Complexity of Contextual Reasoning |
145
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
134
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Directional antennas are a promising option for use in ad-hoc networks for a variety of reasons, such as increased spatial reuse, reduced interference and enabling more effici...
136
Voted
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
152
Voted
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
173
Voted
PCM
2005
Springer
15 years 10 months ago
2005
Springer
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...