Conferences Books
Related Subjects:
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250

Used price: $15.00

Very Helpful, worth reading and extremely valid tips provided in easy to understand language.Review Date: 2007-06-27
Everything it promises!Review Date: 2005-07-12
Excellent Hands-on Exhibition GuideReview Date: 2001-08-04

Used price: $0.43

Great storiesReview Date: 2008-05-01
The book features detailed accounts of each program's successes, terrific recruiting stories, insights into the various coaching personalities, and helps put a lot of the wins and losses into context. A terrific read for any SEC basketball fan.
Perfect for Father's DayReview Date: 2003-06-06
Must read for SEC hoops fansReview Date: 2003-05-30
Highly recommend this book for any fan of the SEC
Used price: $5.96

Beneficial to teachers!Review Date: 1999-04-13
A MUST-HAVE for teachers of writingReview Date: 2003-06-20
practical and effective writing conference strategiesReview Date: 1999-05-02


Great guide and mapsReview Date: 2008-05-06
In principle, either the maps or the book are sufficient to follow the trail, though each conveys useful additional information. Some people might perhaps find the two way too detailed and narrowly focused. In contrast to more comprehensive guidebooks (such as the White Mountain Guide), it describes little more than the AT (a few side trails are described), but in my view it does a fantastic job at what it sets out to. I have used this guidebook in MA and generally found it to be very accurate, even though it is 8 years old.
A great overview of the trail Review Date: 2005-09-02
Used price: $10.80

Definitive guideReview Date: 1998-02-19
Pennsylvania Hiking TrailsReview Date: 2001-04-25

Used price: $40.00

Very clearly writtenReview Date: 1999-07-15
The first half of the book covers the data structures used in solving the network problems that are presented in the second half. These data structures including disjoint sets, heaps, and search trees. Highlights of this half of the book are Tarjan's proof of the amoritized cost of union find, and explaination of self-adjusting binary trees.
The second half of the book covers four classical network problems: minimum spanning tree, shortest paths, network flows (e.g. min-cut), and matchings.
I found the first half of the book more interesting, because more of it was new to me, and because it seemed more likely to be of practical value to me in my work. I have seen presentations of the network problems before, but not with the analysis of efficiency, and comparison of different approaches.
Robert Tarjan (the author) has written many papers on efficient graph algorithms, and appears to be a pioneer in applying proofs of efficiency to graph algorithm. He is often cited in reference to the efficient graph algorithms he has discovered.
This book was published in 1983, but does not seem to be dated.
Deservedly a classicReview Date: 2000-03-23
Most of the optimal algorithms in the book grew out of Tarjan's pioneering work on algorithms that minimizes total complexity by allowing individual chunks of work to consume large amounts of computing resources if they build up "credits" that make subsequent steps more efficient. Until Tarjan used this approach to develop superior algorithms for a number of classical problems, the state of the art had been to limit the resources consumed by each step and bound total complexity by multipying the number of steps by the worst case resource consumption per step.
Tarjan's exposition illustrates the power of abstraction. He uses abstract data types throughout, carefully defining them in terms of their fundamental operations. This approach will be very natural for anyone familiar with object oriented programming.
There is a huge amount of information in very few pages, but it is organized very well. Often Tarjan's carefully chosen words say a lot more than is apparent to casual reader's. I spent one 75 minute period explaining his 12 line proof of one of his algorithms. Then the class demanded that I illustrate how the algorithm actually worked on a real problem, so we spent another 1.5 classes applying the algorithm to a small problem I contrived to exercise all of its boundary conditions.
Other faculty advised me that this book was much too hard for course intended for advanced undergraduate and beginning graduate students, but the students disagreed. More than one commented that the material was hard after first reading, but that after hearing my lectures and rereading their assignments, they realized that it was really pretty easy and that the book presented it well. Most would have appreciated worked out examples to observe the dynamic behavior of the algorithms. One student animated some of the algorithms and went on to write his masters thesis on algorithm animation.


The future in the presentReview Date: 2000-05-15
Advanced info for those wishing to model the Stock MarketReview Date: 2000-04-03
If you are serious about modeling the market using your computer (and making money on your investments) then this book may help you do that. It is a serious book for academically oriented individuals. It has none of the fluff usually contained in consumer targeted books (aka - get rich tomorrow with my new stock picking plan...). One thing I didn't like about it is the smaller print on some of the articles, but this was not a big factor in my decision to buy it. When I saw this book it only took me a few minutes to decide that I was not leaving the store without it.
Used price: $0.01
Collectible price: $15.95

Highly Readable Introduction to the TopicReview Date: 2007-11-08
And you thought the Paris Peace conferenace wasn't fun...Review Date: 2004-05-04
I really enjoyed this book full of short snippets and quick accounts of many aspects of the conference. The anmimosities, the friendships, the never ending sense of confusion.

Used price: $89.85

Crucial, fascinating history of primordial computing.Review Date: 1999-09-11
This is a technical history, and some essays contain technical details. A few border on pedantic, two are bad, but most utterly shine and are brilliantly illuminating. The list of references is wonderful, and with the 'net, may even be findable (most are in-context).
I cannot express what a useful and interesting book this is. Though it might appear to concentrate on U.S. efforts due to the conference location (Los Alamos) in fact most of the early computer work -- and the first *two* running stored program computers -- were British, and are well covered here. A lot of the British work was only declassified in the late 1970's, so the participants are able to talk about it for the first time publically.
There are also papers on early USSR developments, and history of pre- and proto-computing equipment.
Last, but hardly least, for me, in I.J. Good's essay I learned for the first time of Turing's open and unashamed homosexuality -- "... it was only after the war that we learned he was a homosexual... if [security] had known... he might not have obtained his clearance and we might have lost the war." Indeed!
Sadly, this was literally a last-minute collection of data; most of the contributors were quite old when it first published in 1980.
Amusingly (or not), I thought the book was expensive in 1981, at $29.50; now list price is over $100... but if you are serious this is a book to keep forever -- I would pay it now without hesitation (but critical books being this expensive keeps it out hands that could use it...)
This, plus Andrew Hodges' ALAN TURING: THE ENIGMA, have been two of my major inspirational sources for close to 20 years -- what more can I say?
Needs An Update to End the CenturyReview Date: 2004-04-14
The book's time span is an era just before the advent of personal computers and workstations. A lot of the narrative discusses government computing, often military-classified. The heritage of computing. The first modern computer, ENIAC/MANIAC, was built during World War 2 to solve problems in the Manhattan Project at Los Alamos. Ever since, Los Alamos has been at the forefront of high powered computing. Where Metropolis was for decades, in fact.
Soviet computing gets a mention, but understandably sparse. This book was written during the Cold War, and much of the other side's effort was very secretive. So if indeed Metropolis did understate the Soviet effort, it was no fault of his own.
The discussion of commercial computing tends to revolve around IBM and its 360/370 families. IBM dominated commercial computing so thoroughly that its competitors were almost an afterthought.

Used price: $15.00

Good for readers with communitarian interestsReview Date: 2007-01-03
Horse-and-Buggy MennonitesReview Date: 2007-01-09
Thank-you for having such wide choices in literature.
Related Subjects:
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250