Sciweavers

1695 search results - page 27 / 339
» Linear, Polynomial or Exponential
Sort
View
COCOON
2005
Springer
15 years 6 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
ADCM
2010
137views more  ADCM 2010»
14 years 11 months ago
Optimal convergence analysis of an immersed interface finite element method
We analyze an immersed interface finite element method based on linear polynomials on noninterface triangular elements and piecewise linear polynomials on interface triangular elem...
So-Hsiang Chou, Do Y. Kwak, K. T. Wee
APPML
2006
81views more  APPML 2006»
15 years 23 days ago
On the nonlinearity of linear recurrence sequences
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
Igor Shparlinski, Arne Winterhof
108
Voted
CORR
2012
Springer
210views Education» more  CORR 2012»
13 years 8 months ago
Towards minimax policies for online linear optimization with bandit feedback
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
Sébastien Bubeck, Nicolò Cesa-Bianch...
86
Voted
FSTTCS
2006
Springer
15 years 4 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh