Author of the publication

Maximizing Kepler science return per telemetered pixel: Searching the habitable zones of the brightest stars

, , , , , , , , , , , and . (2013)cite arxiv:1309.0654Comment: A white paper submitted in response to the "Kepler Project Office Call for White Papers: Soliciting Community Input for Alternate Science Investigations for the Kepler Spacecraft"; 14 pages in length (that is, a modest 4 pages over the white-paper page limit).

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Improving deduplication techniques by accelerating remainder calculations., , and . Discret. Appl. Math., (2014)Improving Deduplication Techniques by Accelerating Remainder Calculations., , and . Stringology, page 173-183. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2011)Situation Alignment for Distributed Operations.. CogSIMA, page 7-11. IEEE, (2020)Algorithms for the recognition of 2D images of m points and n lines in 3D., , , and . Image Vis. Comput., 21 (6): 497-504 (2003)Making RUP agile.. OOPSLA Practitioners Reports, page 1:1-1:ff. ACM, (2002)Biclique Edge Cover Graphs and Confluent Drawings., , and . GD, volume 4372 of Lecture Notes in Computer Science, page 405-416. Springer, (2006)Moving from a plan driven culture to agile development.. ICSE, page 38. ACM, (2005)The design of a similarity based deduplication system., , , , , and . SYSTOR, page 6. ACM, (2009)Optimal Partitioning of Data Chunks in Deduplication Systems., , and . Stringology, page 128-141. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)Zugänge zur Informatik mit Mindstorms (Teil 1)., , and . LOG IN, 20 (2): 34- (2000)