778 search results - page 73 / 156 » Bounding Smooth Integers |
132
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
142
click to vote
ECRTS
2008
IEEE
15 years 9 months ago
2008
IEEE
Real-time data services can benefit data-intensive real-time applications, e.g., e-commerce, via timely transaction processing using fresh data, e.g., the current stock prices. T...
128
click to vote
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
We complete and bring together two pairs of surface constructions that use polynomial pieces of degree (3,3) to associate a smooth surface with a mesh. The two pairs complement ea...
124
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
138
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...