1333 search results - page 21 / 267 » Not a Number of Floating Point Problems |
110
Voted
CIE
2007
Springer
15 years 6 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
104
Voted
CCCG
2007
15 years 2 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
94
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We consider the problem of source number estimation in array processing when impulsive noise is present. To combat impulsive noise more effectively, two robust estimators with hig...
98
Voted
JCT
2007
15 years 15 days ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
121
click to vote
SIAMCOMP
2008
15 years 16 days ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...