Search For:

Displaying 1-17 out of 17 total
An XML- and Log-Based Infrastructure For Evaluating And Teaching Spatio-Temporal Indexing Schemes
Found in: Database and Expert Systems Applications, International Workshop on
By Ludger Becker, Tobias Gerke, Klaus Hinrichs, Tina Strauf née Hausmann, Jan Vahrenhold
Issue Date:September 2004
pp. 851-855
We present an XML- and log-based infrastructure for spatio-temporal indexing schemes. Our approach is based upon a clear separation between the indexing schemes, algorithms for their visualization, data sets, and the schemes' and data sets' metadata. We sh...
 
Addressing the Full Range of Students: Challenges in K-12 Computer Science Education
Found in: Computer
By Maria Knobelsdorf,Jan Vahrenhold
Issue Date:September 2013
pp. 32-37
While computer science is firmly established in higher education, introducing and maintaining CS as a regular K-12 subject remains a major challenge. From a pedagogical perspective, this requires adapting the curriculum to students at widely varying levels...
 
Detecting Quasars in Large-Scale Astronomical Surveys
Found in: Machine Learning and Applications, Fourth International Conference on
By Fabian Gieseke, Kai Lars Polsterer, Andreas Thom, Peter Zinn, Dominik Bomanns, Ralf-Jürgen Dettmar, Oliver Kramer, Jan Vahrenhold
Issue Date:December 2010
pp. 352-357
We present a classification-based approach to identify quasi-stellar radio sources (quasars) in the Sloan Digital Sky Survey and evaluate its performance on a manually labeled training set. While reasonable results can already be obtained via approaches wo...
 
Resilient K-d Trees: K-Means in Space Revisited
Found in: Data Mining, IEEE International Conference on
By Fabian Gieseke, Gabriel Moruz, Jan Vahrenhold
Issue Date:December 2010
pp. 815-820
We develop a k-d tree variant that is resilient to a pre-described number of memory corruptions while still using only linear space. We show how to use this data structure in the context of clustering in high-radiation environments and demonstrate that our...
 
On plugging "unplugged" into CS classes
Found in: Proceeding of the 44th ACM technical symposium on Computer science education (SIGCSE '13)
By Jan Vahrenhold, Renate Thies
Issue Date:March 2013
pp. 365-370
A variety of experience reports and studies has shown Computer Science Unplugged to be an effective resource for outreach, and it has been suggested to build upon these benefits to augment teaching in a regular classroom as well. Based upon an analysis of ...
     
Hunting high and low: instruments to detect misconceptions related to algorithms and data structures
Found in: Proceeding of the 44th ACM technical symposium on Computer science education (SIGCSE '13)
By Jan Vahrenhold, Wolfgang Paul
Issue Date:March 2013
pp. 29-34
We present the result of assessing first-year students' misconceptions related to algorithms and data structures. Our study confirms findings from previous small-scale studies but additionally broadens the scope of the topics and methods investigated. The ...
     
On the importance of being earnest: challenges in computer science education
Found in: Proceedings of the 7th Workshop in Primary and Secondary Computing Education (WiPSCE '12)
By Jan Vahrenhold
Issue Date:November 2012
pp. 3-4
Despite an increasing number of success reports from several countries, establishing computer science as a subject worth full curriculum credit is one of the most frequently named goals in secondary computer science education. In my keynote address, I will...
     
Of motifs and goals: mining trajectory data
Found in: Proceedings of the 20th International Conference on Advances in Geographic Information Systems (SIGSPATIAL '12)
By Andreas Thom, Jan Vahrenhold, Joachim Gudmundsson
Issue Date:November 2012
pp. 129-138
In response to the increasing volume of trajectory data obtained, e.g., from tracking athletes, animals, or meteorological phenomena, we present a new space-efficient algorithm for the analysis of trajectory data. The algorithm combines techniques from com...
     
Reflections on outreach programs in CS classes: learning objectives for "unplugged" activities
Found in: Proceedings of the 43rd ACM technical symposium on Computer Science Education (SIGCSE '12)
By Jan Vahrenhold, Renate Thies
Issue Date:February 2012
pp. 487-492
To provide a unified view of any scientific field, outreach programs need to realistically portray the subject in question. Consequently, topics and methods actually taught in Computer Science courses should to be touched upon in Computer Science outreach ...
     
Design and evaluation of a braided teaching course in sixth grade computer science education
Found in: Proceedings of the 43rd ACM technical symposium on Computer Science Education (SIGCSE '12)
By Jan Vahrenhold, Arno Pasternak
Issue Date:February 2012
pp. 45-50
We report on the design and evaluation of the first year of a Computer Science course in lower secondary education that implements the concept of braided teaching. Besides being a proof-of-concept, our study demonstrates that students an indeed be taught C...
     
Detecting and understanding students' misconceptions related to algorithms and data structures
Found in: Proceedings of the 43rd ACM technical symposium on Computer Science Education (SIGCSE '12)
By Holger Danielsiek, Wolfgang Paul, Jan Vahrenhold
Issue Date:February 2012
pp. 21-26
We describe the first results of our work towards a concept inventory for Algorithms and Data Structures. Based on expert interviews and the analysis of 400 exams we were able to identify several core topics which are prone to error. In a pilot study, we v...
     
Preface
Found in: Journal of Experimental Algorithmics (JEA)
By Jan Vahrenhold
Issue Date:May 2011
pp. 2.1-2.1
In practical applications, algorithms for the classic version of the hospitals residents problem (the many-one version of the stable marriage problem) may have to be extended to accommodate the needs of couples who wish to be allocated to (geographically) ...
     
Professional associations in K-12 computer science
Found in: Proceedings of the fifteenth annual conference on Innovation and technology in computer science education (ITiCSE '10)
By Chris Stephenson, Jan Vahrenhold, Judith Gal-Ezer, Margot Phillipps
Issue Date:June 2010
pp. 329-330
This panel will examine the challenges associated with establishing and maintaining computer science subject associations and ensuring their potential for improving all aspects of teaching and learning. The members of this panel have a wealth of experience...
     
Braided teaching in secondary CS education: contexts, continuity, and the role of programming
Found in: Proceedings of the 41st ACM technical symposium on Computer science education (SIGCSE '10)
By Arno Pasternak, Jan Vahrenhold
Issue Date:March 2010
pp. 204-208
In this paper, we propose a new approach to thinking about and implementing Computer Science curricula in secondary education. The characteristic feature is to organize the items to be taught into what we call "strands" which then can be interlaced during ...
     
Terracost: Computing least-cost-path surfaces for massive grid terrains
Found in: Journal of Experimental Algorithmics (JEA)
By Jan Vahrenhold, Laura Toma, Rajiv Wickremesinghe, Thomas Hazel
Issue Date:June 2008
pp. 1-22
This paper addresses the problem of computing least-cost-path surfaces for massive grid terrains. Consider a grid terrain T and let C be a cost grid for T such that every point in C stores a value that represents the cost of traversing the corresponding po...
     
TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains
Found in: Proceedings of the 2006 ACM symposium on Applied computing (SAC '06)
By Jan Vahrenhold, Laura Toma, Rajiv Wickremesinghe, Tom Hazel
Issue Date:April 2006
pp. 52-57
This paper addresses the problem of computing least-cost-path surfaces for massive grid-based terrains. Our approach follows a modular design, enabling the algorithm to make efficient use of memory, disk, and grid computing environments. We have implemente...
     
I/O-efficient dynamic planar point location (extended abstract)
Found in: Proceedings of the sixteenth annual symposium on Computational geometry (SCG '00)
By Jan Vahrenhold, Lars Arge
Issue Date:June 2000
pp. 191-200
An interactive visualization of weighted three-dimensional α-hulls is presented for static and dynamic spheres. The α-hull is analytically computed and represented by a triangulated mesh. The entire surface is computed and displayed in real-time ...
     
 1