Sciweavers

1333 search results - page 70 / 267
» Not a Number of Floating Point Problems
Sort
View
GD
2009
Springer
15 years 8 months ago
Removing Independently Even Crossings
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
129
Voted
ALGOSENSORS
2009
Springer
15 years 10 months ago
Building a Communication Bridge with Mobile Hubs
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Jana...
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 6 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
COMPGEOM
2009
ACM
15 years 10 months ago
Halving lines and measure concentration in the plane
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...
Rom Pinchasi
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
15 years 5 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison