214 search results - page 32 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
IPPS
2002
IEEE
15 years 3 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
COCOA
2009
Springer
15 years 1 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
95
Voted
CPM
2006
Springer
15 years 1 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
100
click to vote
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
QEST
2008
IEEE
15 years 4 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...