Sciweavers

4894 search results - page 742 / 979
» Choices
Sort
View
DAM
2008
140views more  DAM 2008»
15 years 6 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
ML
2007
ACM
127views Machine Learning» more  ML 2007»
15 years 6 months ago
Density estimation with stagewise optimization of the empirical risk
We consider multivariate density estimation with identically distributed observations. We study a density estimator which is a convex combination of functions in a dictionary and ...
Jussi Klemelä
MST
2007
168views more  MST 2007»
15 years 6 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
PAMI
2007
156views more  PAMI 2007»
15 years 6 months ago
Selection and Fusion of Color Models for Image Feature Detection
—The choice of a color model is of great importance for many computer vision algorithms (e.g., feature detection, object recognition, and tracking) as the chosen color model indu...
Harro M. G. Stokman, Theo Gevers
PC
2007
123views Management» more  PC 2007»
15 years 6 months ago
MPI collective algorithm selection and quadtree encoding
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....