943 search results - page 81 / 189 » How should data structures and algorithms be taught |
128
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
159
click to vote
ICALP
1994
Springer
15 years 7 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
105
click to vote
CAISE
2008
Springer
15 years 5 months ago
2008
Springer
Service granularity generally refers to the size of a service. The fact that services should be large-sized or coarse-grained is often postulated as a fundamental design principle ...
122
click to vote
NIPS
2007
15 years 4 months ago
2007
Natural sounds are structured on many time-scales. A typical segment of speech, for example, contains features that span four orders of magnitude: Sentences (∼1 s); phonemes (âˆ...
120
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...