Sciweavers

7930 search results - page 647 / 1586
» Greedy in Approximation Algorithms
Sort
View
MVA
2010
126views Computer Vision» more  MVA 2010»
15 years 5 months ago
Rapid automated detection of roots in minirhizotron images
An approach for rapid, automatic detection of plant roots in minirhizotron images is presented. The problem is modeled as a Gibbs point process with a modified Candy model, in wh...
Guang Zeng, Stanley T. Birchfield, Christina E. We...
TCOM
2011
170views more  TCOM 2011»
15 years 2 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
TWC
2010
15 years 1 months ago
Distributed Node Selection for Sequential Estimation over Noisy Communication Channels
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
Thakshila Wimalajeewa, Sudharman K. Jayaweera
AIPS
2011
14 years 11 months ago
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Gef...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 10 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...