Sciweavers

103 search results - page 20 / 21
» Generalized MPU Implicits Using Belief Propagation
Sort
View
DCOSS
2006
Springer
13 years 9 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
PAMI
2010
215views more  PAMI 2010»
13 years 3 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
SIGMOD
2010
ACM
211views Database» more  SIGMOD 2010»
13 years 10 months ago
ERACER: a database approach for statistical inference and data cleaning
Real-world databases often contain syntactic and semantic errors, in spite of integrity constraints and other safety measures incorporated into modern DBMSs. We present ERACER, an...
Chris Mayfield, Jennifer Neville, Sunil Prabhakar
CCS
2008
ACM
13 years 7 months ago
Code injection attacks on harvard-architecture devices
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...
Aurélien Francillon, Claude Castelluccia
IGPL
2010
161views more  IGPL 2010»
13 years 3 months ago
Extending the Hegselmann-Krause Model I
Hegselmann and Krause have developed a simple yet powerful computational model for studying the opinion dynamics in societies of epistemically interacting truth-seeking agents. We...
Igor Douven, Alexander Riegler