Sciweavers

2466 search results - page 287 / 494
» Algorithms for distributed functional monitoring
Sort
View
ISPAN
2002
IEEE
15 years 7 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
109
Voted
ECCC
2007
86views more  ECCC 2007»
15 years 2 months ago
Testing Halfspaces
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
142
Voted
JMLR
2002
111views more  JMLR 2002»
15 years 2 months ago
The Learning-Curve Sampling Method Applied to Model-Based Clustering
We examine the learning-curve sampling method, an approach for applying machinelearning algorithms to large data sets. The approach is based on the observation that the computatio...
Christopher Meek, Bo Thiesson, David Heckerman
132
Voted
ICIP
2003
IEEE
16 years 4 months ago
Sequential Monte Carlo video text segmentation
This paper presents a probabilistic algorithm for segmenting and recognizing text embedded in video sequences. The algorithm approximates the posterior distribution of segmentatio...
Datong Chen, Jean-Marc Odobez
89
Voted
GECCO
2009
Springer
15 years 9 months ago
Optimal robust expensive optimization is tractable
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
Philippe Rolet, Michèle Sebag, Olivier Teyt...