1390 search results - page 75 / 278 » Computing the depth of a flat |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
100
click to vote
DCG
2011
14 years 4 months ago
2011
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
TCS
2010
14 years 4 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
RT
2000
Springer
15 years 1 months ago
2000
Springer
This paper reviews recent psychophysical methods that have been developed for measuring the perceived shape of objects. We discuss two types of shape ambiguities that exist for man...
ACL
1989
14 years 11 months ago
1989
the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The a...