10805 search results - page 2036 / 2161 » Mapping Computation with No Memory |
174
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
165
click to vote
ICIAR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Background updating is an important aspect of dynamic scene analysis. Two critical problems: sudden camera perturbation and the sleeping person problem, which arise frequ...
166
Voted
INDOCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
151
Voted
OOPSLA
2005
Springer
15 years 9 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
146
Voted
OOPSLA
2005
Springer
15 years 9 months ago
2005
Springer
Can virtual machine developers benefit from religiously observing the principles more often embraced for exploratory programming? To find out, we are concurrently constructing two...