4542 search results - page 94 / 909 » Design patterns for data structures |
105
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
123
click to vote
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
— Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control...
116
click to vote
EMMCVPR
2001
Springer
15 years 7 months ago
2001
Springer
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
130
click to vote
JDA
2006
15 years 2 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
119
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
The novel design of an efficient FPGA interconnection architecture with multiple Switch Boxes (SB) and hardwired connections for realizing data intensive applications (i.e. DSP ap...