Sciweavers

821 search results - page 32 / 165
» Energy Efficient Algorithms for the RFID Estimation Problem
Sort
View
IPSN
2005
Springer
15 years 11 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
AINA
2008
IEEE
15 years 8 months ago
A Communication-Efficient Distributed Clustering Algorithm for Sensor Networks
Sensor networks usually generate continuous stream of data over time. Clustering sensor data as a core task of mining sensor data plays an essential role in analytical application...
Amirhosein Taherkordi, Reza Mohammadi, Frank Elias...
JVCA
2008
89views more  JVCA 2008»
15 years 5 months ago
A physically faithful multigrid method for fast cloth simulation
We present an efficient multigrid algorithm that is adequate to solve a heavy linear system given in cloth simulation. Although multigrid has been successfully applied to the Pois...
Seungwoo Oh, Jun-yong Noh, KwangYun Wohn
CVPR
2009
IEEE
17 years 1 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
ICCV
2009
IEEE
16 years 11 months ago
Higher-Order Gradient Descent by Fusion-Move Graph Cut
Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higherorder graph...
Hiroshi Ishikawa