5639 search results - page 451 / 1128 » Timed Abstract Non-interference |
143
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
152
click to vote
ICCS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
125
click to vote
ISAAC
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
153
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
156
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...