Results 1 - 10 of 60

Table 1. First 32 Fixed Points of Michael

in Security Analysis of Michael: the IEEE 802.11i Message Integrity Code
by unknown authors
"... In PAGE 10: ...8 GHz, and the pro- gram only takes 2-3 minutes to decide whether there exists a xed point for a given Ri. We provide the rst 32 xed points found by using our method in Table1 (Numbers are hexadecimal and listed in increasing or- der according to Ri). A more complete table is provided in the Appendix... ..."

TABLE 7. Human Task Group Participants Name Organization Jon Vestal Internap Network Services Michael Diorio MCI

in unknown title
by unknown authors 2004

Table 4. Flow Conditions for Michael 9A-8 Trajectory Cases Mach

in X-33 Aerodynamic and Aeroheating Computations for Wind Tunnel and Flight Conditions
by Christopher J. Riley, Stephen J. Alter, Brian R. Hollis, Brian R. Hollis, Richard A. Thompson, Richard A. Thompson, Kelly J. Murphy, Kelly J. Murphy, Robert J. Nowak, Robert J. Nowak, Christopher J. Riley*à, William A. Wood, William A. Wood, Stephen J. Alter*à, Ramadas K. Prabhu, Ramadas K. Prabhu
"... In PAGE 7: ... 35), which was current at the time this research was begun. Freestream conditions for these points are listed in Table4 . Case 1 is the peak heating point on the trajectory.... ..."

Table 5. The number of times a prime p 97 occurs in a Car- michael number

in The Carmichael Numbers up to 10^15
by R.G.E. Pinch 1992
"... In PAGE 6: ... In Tables 5 and 6 we give the number of Carmichael numbers divisible by primes p up to 97. In Table5... ..."

Table 1 Maximum speedup over Minos or Lemke Acknowledgement We are grateful to Michael C. Ferris and Steven P. Dirkse for letting us use their implementation of the sparse Lemke method for comparison purposes.

in Smoothing Methods for Convex Inequalities and Linear Complementarity Problems
by Chunhui Chen Mangasarian, Chunhui Chen, O. L. Mangasarian 1995
"... In PAGE 14: ... The smooth algorithm is always better than Lemke apos;s method for both dense as well as the sparse problems. We conclude with Table1 , that shows the potential of our smoothing methods as indicated by the maximum speedup that was achieved over standard algorithms. This table shows that smoothing techniques can be very e ective for solving linear and convex inequalities as well as linear complementarity problems and hence warrant further study.... ..."
Cited by 44

Table 1 Maximum speedup over Minos or Lemke Acknowledgement We are grateful to Michael C. Ferris and Steven P. Dirkse for letting us use their implementation of the sparse Lemke method for comparison purposes.

in Smoothing Methods for Convex Inequalities and Linear Complementarity Problems
by Chunhui Chen, O. L. Mangasarian 1995
"... In PAGE 14: ... The smooth algorithm is always better than Lemke apos;s method for both dense as well as the sparse problems. We conclude with Table1 , that shows the potential of our smoothing methods as indicated by the maximum speedup that was achieved over standard algorithms. This table shows that smoothing techniques can be very e ective for solving linear and convex inequalities as well as linear complementarity problems and hence warrant further study.... ..."
Cited by 44

Table 3: Left: Top 6 results for the query Michael Jordan and the information need category general introductory , after a few seconds, Right: Top 6 results, same query, after 50 total pages downloaded

in Recommending Web Documents Based on User Preferences
by Eric J. Glover, Steve Lawrence, Michael D. Gordon, William P. Birmingham, C. Lee Giles
"... In PAGE 5: ... Without a dynamic interface, the system can not show any sorted results until all results have been scored. Table3 lists the top six results as seen after only a few seconds, and at the completion of the search (when asking... ..."

lable via anonymous ftp cite ftp-bionik.fb10.tu-berlin.de directory /pub/papers/BIONIK/PAPERS le tr-03-95.ps.Z ) y(Born) ga95aSantibanez-Koref. [343] Hans-Michael Voigt and Thomas Anheyer. Modal mutations in evolutionary algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation [600], pages 88{92. ga94bVoigt. [344] Hans-Michael Voigt. Soft genetic operators in evolutionary algorithms. In Alander [628], pages 1{22. ( available via anonymous ftp cite ftp.uwasa.fi directory cs/1NWGA le Voigt.ps.Z ) ga95aVoigt. [345] Hans-Michael Voigt, Heinz M uhlenbein, and D. Cvetkovic. Fuzzy recombination for the continuous breeder genetic algorithm. In Eshelman [603], page ? y(prog) ga95bVoigt.

in unknown title
by unknown authors

Table 1.2: Schedule of the REINAS Project apos;s First Two Years. 3. Emil Petruncio - Characterization of Tidal Currents in Monterey Bay from Remote and In-Situ Measurements 4. Pat Cross - A Comparison of Modeled and Observed Ocean Mixed Layer Behavior in a Sea Breeze In uenced Coastal Region 5. Michael Knapp - Synoptic-Scale In uence on the Monterey Bay Sea-Breeze

in REINAS: Real-Time Environmental Information Network and Analysis System: Phase IV.1-EXPERIMENTATION
by P. E. Mantey, D. D. E. Long, J. J. Garcia-luna, A. T. Pang, H.G. Kolsky, B.R. Gritton, W.A. Nuss, H. G. Kolsky (ucsc, B. R. Gritton (mbari, W. A. Nuss (nps 1995
Cited by 10

Table 3 Image data and comparison of digital file size (Adapted from reference: Going digital: Image preparation for biomedical publishing Michael P Schenk*, Richard J Manning, Mark H Paalman. The Anatomical Record Volume 257, Issue 4, 1999) Note : dpi denotes (dots per inch resolution) Subject Resolution (dpi)

in unknown title
by unknown authors
"... In PAGE 2: ... This is advantageous, since native diagnostic quality images are of large file size. A comparison of image data and digital file size is given as Table3 . Moreover, the JPG format allows preservation of both 24 bit color ( true color) as well as 17 million color ( diagnostic quality color).... ..."
Results 1 - 10 of 60