Sciweavers

1814 search results - page 101 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CVPR
2011
IEEE
15 years 2 months ago
Semantic structure from motion
Conventional rigid structure from motion (SFM) addresses the problem of recovering the camera parameters (motion) and the 3D locations (structure) of scene points, given observed ...
Sid Ying-Ze Bao, Silvio Savarese
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 7 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...
PLDI
2004
ACM
15 years 11 months ago
Min-cut program decomposition for thread-level speculation
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykuma...
ML
2002
ACM
141views Machine Learning» more  ML 2002»
15 years 5 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
178
Voted
JSA
2000
175views more  JSA 2000»
15 years 5 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd