628 search results - page 18 / 126 » The minimum shift design problem |
WDAG
2001
Springer
13 years 11 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
STOC
1995
ACM
13 years 11 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
MT
2010
13 years 5 months ago
2010
In Minimum Error Rate Training (MERT), BLEU is often used as the error function, despite the fact that it has been shown to have a lower correlation with human judgment than other...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...