Sciweavers

943 search results - page 142 / 189
» How should data structures and algorithms be taught
Sort
View
CLA
2007
13 years 9 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
CCR
2002
97views more  CCR 2002»
13 years 7 months ago
Multi-modal network protocols
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
Rajesh Krishna Balan, Aditya Akella, Srinivasan Se...
LFCS
2007
Springer
14 years 2 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
ICFP
2010
ACM
13 years 9 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
VIS
2004
IEEE
174views Visualization» more  VIS 2004»
14 years 9 months ago
A Graphics Hardware-Based Vortex Detection and Visualization System
Feature detection in flow fields is a well researched area, but practical application is often difficult due to the numerical complexity of the algorithms preventing interactive u...
Simon Stegmaier, Thomas Ertl