2376 search results - page 30 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
To improve the accuracy of tissue structural and architectural characterization with diffusion tensor imaging, an anisotropic smoothing algorithm is presented for reducing noise i...
DASFAA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...