451 search results - page 47 / 91 » Some Lower Bounds on Geometric Separability Problems |
64
Voted
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper addresses the problem of restoring standing in paralegia via functional electrical stimulation (FES) and investigates the relashionship between body posture and volu...
TIP
2010
14 years 4 months ago
2010
Abstract--Can images be decomposed into the sum of a geometric part and a textural part? In a theoretical breakthrough, [Y. Meyer, Oscillating Patterns in Image Processing and Nonl...
ALGORITHMICA
2011
14 years 4 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
102
click to vote
ACL
2011
14 years 1 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...