1169 search results - page 104 / 234 » Degrees of monotone complexity |
MOC
1998
15 years 19 days ago
1998
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
79
Voted
TMI
2002
15 years 19 days ago
2002
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
TCS
2010
14 years 7 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
209
Voted
FCSC
2011
14 years 4 months ago
2011
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...
138
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...