Sciweavers

19320 search results - page 3473 / 3864
» On the complexity of computing determinants
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 8 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
VMV
2001
178views Visualization» more  VMV 2001»
15 years 8 months ago
Consistent Visual Information Processing Applied to Object Recognition Landmark Definition and Real-Time Tracking
The handling of situations where multiple visual information occurs requires the fusion of visual information. This is a very common task found in the processing of multisource / ...
Axel Pinz
VMV
2001
168views Visualization» more  VMV 2001»
15 years 8 months ago
High-quality Volume Rendering of Adaptive Mesh Refinement Data
Adaptive mesh refinement (AMR) is a numerical simulation technique used in computational fluid dynamics (CFD). By using a set of nested grids of different resolutions, AMR combine...
Gunther H. Weber, Oliver Kreylos, Terry J. Ligocki...
UAI
2004
15 years 8 months ago
On the Choice of Regions for Generalized Belief Propagation
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
Max Welling
« Prev « First page 3473 / 3864 Last » Next »