4761 search results - page 544 / 953 » Generalizing Boundary Points |
149
click to vote
POPL
1994
ACM
15 years 11 months ago
1994
ACM
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
181
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
138
click to vote
SWAT
1990
Springer
15 years 11 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
141
Voted
ACMSE
2007
ACM
15 years 11 months ago
2007
ACM
Information security is a growing concern today for organizations and individuals alike. This has led to growing interest in more aggressive forms of defense to supplement the exi...
184
click to vote
AOSD
2007
ACM
15 years 11 months ago
2007
ACM
This position paper proposes the use of an event-based dynamic AOP machine as an infrastructure for interactive development of high performance scientific software. Advice codes i...