Sciweavers

120 search results - page 9 / 24
» New completeness results for lazy conditional narrowing
Sort
View
MSN
2005
Springer
14 years 1 months ago
Handling Sensed Data in Hostile Environments
Systems that track sensed data trigger alerts based on the evaluation of some condition. In the presence of loss data a conservative condition may not generate a necessary alert an...
Oren Ben-Zwi, Shlomit S. Pinter
INFOCOM
2012
IEEE
11 years 10 months ago
Sherlock is around: Detecting network failures with local evidence fusion
—Traditional approaches for wireless sensor network diagnosis are mainly sink-based. They actively collect global evidences from sensor nodes to the sink so as to conduct central...
Qiang Ma, Kebin Liu, Xin Miao, Yunhao Liu
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
AIPS
2004
13 years 9 months ago
Complexity of Planning with Partial Observability
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
Jussi Rintanen
NAACL
2010
13 years 5 months ago
Unsupervised Model Adaptation using Information-Theoretic Criterion
In this paper we propose a novel general framework for unsupervised model adaptation. Our method is based on entropy which has been used previously as a regularizer in semi-superv...
Ariya Rastrow, Frederick Jelinek, Abhinav Sethy, B...