Sciweavers

1729 search results - page 109 / 346
» Deterministic Expressions in C
Sort
View
162
Voted
MICS
2007
90views more  MICS 2007»
15 years 5 months ago
Approximation by Conic Splines
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
Sunayana Ghosh, Sylvain Petitjean, Gert Vegter
PODC
2005
ACM
15 years 11 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
STACS
2005
Springer
15 years 11 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
JSW
2008
95views more  JSW 2008»
15 years 6 months ago
Quality-of-Context and its use for Protecting Privacy in Context Aware Systems
Context-awareness refers to systems that unobtrusively adapt to the environment of their users on the basis of context information, popularly known as contextaware systems. One inh...
Kamran Sheikh, Maarten Wegdam, Marten van Sinderen
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
16 years 6 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan