Sciweavers

394 search results - page 1 / 79
» Expected Case for Projecting Points
Sort
View
INFORMATICASI
2006
53views more  INFORMATICASI 2006»
13 years 10 months ago
Expected Case for Projecting Points
Sergio Cabello, Matt DeVos, Bojan Mohar
FOCS
2000
IEEE
14 years 3 months ago
Nearly Optimal Expected-Case Planar Point Location
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...
Sunil Arya, Theocharis Malamatos, David M. Mount
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 2 months ago
Efficient Expected-Case Algorithms for Planar Point Location
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...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ACE
2004
224views Education» more  ACE 2004»
14 years 7 days ago
Automating the Estimation of Project Size from Software Design Tools Using Modified Function Points
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...
Jason Ceddia, Martin Dick
ACL
2009
13 years 8 months ago
Non-Projective Dependency Parsing in Expected Linear Time
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...
Joakim Nivre