2766 search results - page 488 / 554 » Algorithms for trigonometric polynomials |
JGT
2010
14 years 10 months ago
2010
: We prove that the strong product G1 G2 of G1 and G2 is Z3-flow contractible if and only if G1 G2 is not T K2, where T is a tree (we call T K2 a K4-tree). It follows that G1 G2 ad...
101
click to vote
JUCS
2010
14 years 10 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
106
click to vote
MST
2010
14 years 10 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
PERCOM
2010
ACM
14 years 10 months ago
2010
ACM
Abstract—Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that proved to work well in previous work ar...
SSS
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...