3663 search results - page 417 / 733 » Problems in the ontology of computer programs |
168
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
157
Voted
EUROPAR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
202
Voted
ICNSC
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, a variance constrained filtering problem is considered for systems with both non-Gaussian noises and polytopic uncertainty. A novel filter is developed to estimate t...
164
click to vote
ICPR
2006
IEEE
16 years 24 days ago
2006
IEEE
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
209
click to vote
CVPR
2003
IEEE
16 years 2 days ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...