1208 search results - page 209 / 242 » Uniform eventown problems |
FOCS
2000
IEEE
15 years 2 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...
SIGGRAPH
1999
ACM
15 years 2 months ago
1999
ACM
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
SIGOPSE
1998
ACM
15 years 1 months ago
1998
ACM
The majority of work on protection in single-language mobile code environments focuses on information security issues and depends on the language environment for solutions to the ...
STOC
1994
ACM
15 years 1 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
SWAT
2000
Springer
15 years 1 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...