2252 search results - page 166 / 451 » Lower Bounds for Dynamic Algorithms |
110
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
138
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
113
click to vote
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
92
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this work, a PI-type control scheme for the outlet temperature regulation of double-pipe heat exchangers is proposed. Compared to previously proposed approaches, the algorit...
140
Voted
SODA
2010
ACM
16 years 27 days ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...