194 search results - page 19 / 39 » Computing Roundness is Easy if the Set is Almost Round |
176
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
170
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
186
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
157
click to vote
ICC
2007
IEEE
16 years 27 days ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
161
click to vote
CSIE
2009
IEEE
16 years 1 months ago
2009
IEEE
A multi-party contract signing (MPCS) protocol allows a set of parties to exchange messages with each other to arrive in a state in which either each of them has a pre-agreed cont...