4066 search results - page 244 / 814 » Almost Complete Sets |
150
click to vote
COMPGEOM
2004
ACM
16 years 21 hour ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
170
click to vote
CC
2004
Springer
15 years 12 months ago
2004
Springer
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
189
click to vote
CLEF
2004
Springer
15 years 12 months ago
2004
Springer
Following the pilot Question Answering Track at CLEF 2003, a new evaluation exercise for multilingual QA systems took place in 2004. This paper reports on the novelties introduced...
170
click to vote
EMSOFT
2004
Springer
15 years 12 months ago
2004
Springer
Security concerns on embedded devices like cellular phones make Java an extremely attractive technology for providing third-party and user-downloadable functionality. However, gar...
202
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...