Sciweavers

185 search results - page 20 / 37
» Local Monotonicity in Probabilistic Networks
Sort
View
MOBIDE
2006
ACM
14 years 1 months ago
Towards correcting input data errors probabilistically using integrity constraints
Mobile and pervasive applications frequently rely on devices such as RFID antennas or sensors (light, temperature, motion) to provide them information about the physical world. Th...
Nodira Khoussainova, Magdalena Balazinska, Dan Suc...
QEST
2009
IEEE
14 years 2 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
SAC
2006
ACM
14 years 1 months ago
Facial emotion recognition by adaptive processing of tree structures
We present an emotion recognition system based on a probabilistic approach to adaptive processing of Facial Emotion Tree Structures (FETS). FETS are made up of localized Gabor fea...
Jia-Jun Wong, Siu-Yeung Cho
ADHOC
2007
144views more  ADHOC 2007»
13 years 7 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 7 months ago
Domain-constrained semi-supervised mining of tracking models in sensor networks
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...
Rong Pan, Junhui Zhao, Vincent Wenchen Zheng, Jeff...