Sciweavers

2969 search results - page 453 / 594
» A space efficient algorithm for group structure computation
Sort
View
MVA
2010
126views Computer Vision» more  MVA 2010»
15 years 4 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...
CVPR
2003
IEEE
16 years 8 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
BMCBI
2011
14 years 10 months ago
The Proteogenomic Mapping Tool
Background: High-throughput mass spectrometry (MS) proteomics data is increasingly being used to complement traditional structural genome annotation methods. To keep pace with the...
William S. Sanders, Nan Wang, Susan M. Bridges, Br...
179
Voted
CF
2004
ACM
15 years 11 months ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 6 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...