943 search results - page 82 / 189 » How should data structures and algorithms be taught |
156
click to vote
PDSE
1998
15 years 4 months ago
1998
This paper describes how to reduce the burden of parallel programming by utilizing relevant parallel programs. Parallel algorithms are divided into four classes and a case base fo...
115
click to vote
MOBICOM
1998
ACM
15 years 7 months ago
1998
ACM
CT In order to support location-aware applications it is necessary to locate people and equipment in near real-time. To avoid unnecessary exposure of details of the underlying trac...
115
click to vote
OTM
2010
Springer
15 years 29 days ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
138
click to vote
DCC
2000
IEEE
15 years 7 months ago
2000
IEEE
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
123
click to vote
CALC
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...