Sciweavers

712 search results - page 125 / 143
» A mixture model for random graphs
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
OBJ CUT
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ACISICIS
2007
IEEE
14 years 2 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
Gerhard Visser, David L. Dowe
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 7 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 5 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 10 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang