Sciweavers

4516 search results - page 710 / 904
» Data Structures in the Design of Interfaces
Sort
View
132
Voted
CF
2005
ACM
15 years 6 months ago
Sparse matrix storage revisited
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
Malik Silva
113
Voted
EDM
2010
150views Data Mining» more  EDM 2010»
15 years 6 months ago
Modeling Learning Trajectories with Epistemic Network Analysis: A Simulation-based Investigation of a Novel Analytic Method for
Epistemic games are designed to help players develop domain-specific expertise that characterizes how professionals in a particular domain reason, communicate, and act [1, 11]. To ...
Andre A. Rupp, Shauna J. Sweet, Younyoung Choi
METMBS
2004
162views Mathematics» more  METMBS 2004»
15 years 6 months ago
A Comparison of DNA Fragment Assembly Algorithms
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
Lishan Li, Sami Khuri
JSAT
2008
57views more  JSAT 2008»
15 years 4 months ago
tts: A SAT-Solver for Small, Difficult Instances
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
Ivor Spence
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
15 years 4 months ago
Biased Skip Lists
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goo...