2766 search results - page 153 / 554 » Algorithms for trigonometric polynomials |
121
click to vote
MOR
2002
15 years 3 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
114
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
102
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
126
click to vote
ACSD
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
236
click to vote
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...