774 search results - page 69 / 155 » A subdivision-based algorithm for the sparse resultant |
114
click to vote
MOC
2011
14 years 4 months ago
2011
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
188
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
113
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
131
click to vote
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
126
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...