Results for:
"
Mordecai+Richler
" in Documents
- A dedicated medical student: Solomon Mordecai, 1819-1822.
-
Rating:
Views: (1)
Pages: ()
Uploaded: 1987-1-1
- Israel Mordecai Rabinowitch (1890-1983): a father of clinical chemistr...
-
Rating:
Views: (1)
Pages: ()
Uploaded: 1987-1-1
- Waldemar Mordecai Haffkine, CIE (1860-1930): prophylactic vaccination ...
- Waldemar Mordecai Haffkine developed an anticholera vaccine at the Pasteur Institute, Paris, in 1892. From the results of field trials in India from 1893 to 1896, he has been credited as having carrie...
-
Rating:
Views: (1)
Pages: ()
Uploaded: 2007-3-16
- Incremental Algorithms for Finding the Convex Hulls of Circles and the...
- : The existing O(n log n) algorithms for finding the convex hulls of circles and the lower envelope of parabolas follow the divide-and-conquer paradigm. The difficulty with developing incremental algo...
-
Rating:
Views: (1023)
Pages: ()
Uploaded: 13-05-09
- A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free C...
- We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this problem has been unclear for thirty year...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09
- A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free C...
- We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this problem has been unclear for thirty year...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 15-05-09
- Revenge of the dog Queries on Voronoi diagrams of moving points 1994
- Suppose we are given n moving postmen described by their motion equations p i #t#=s i + v i t; i =1;:::;n, where s i 2 IR is the position of the i'th postman at time t = 0, and v i 2 IR is his velocit...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 15-05-09
- A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free C...
- We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this problem has been unclear for thirty year...
-
Rating:
Views: (1023)
Pages: ()
Uploaded: 15-05-09