5022 search results - page 788 / 1005 » Data structures and problem solving using Java |
99
Voted
STACS
1997
Springer
15 years 6 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
126
click to vote
SWAT
1992
Springer
15 years 6 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
130
click to vote
EDUTAINMENT
2008
Springer
15 years 4 months ago
2008
Springer
Hyperlinks among webpages are very important information and are widely used for webpage clustering and webpage ranking. With the explosive growth in the number of webpages availab...
148
click to vote
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
106
Voted
COMCOM
2006
15 years 2 months ago
2006
In the paper, we consider a preference heterogeneity problem in large-scale multicast applications. Abundant content, data type and diverse members' interests naturally lead ...