394 search results - page 1 / 79 » Expected Case for Projecting Points |
INFORMATICASI
2006
13 years 5 months ago
2006
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
SWAT
2000
Springer
13 years 9 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
ACE
2004
13 years 7 months ago
2004
Final year students in the Bachelor of Computing complete an industry project where they work in teams to build an IT system for an external client. Grading projects in these circ...
ACL
2009
13 years 3 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...