Sciweavers

1379 search results - page 266 / 276
» codes 2009
Sort
View
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
14 years 1 months ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark
AIED
2009
Springer
14 years 1 months ago
Scaffolding Motivation and Metacognition in Learning Programming
This paper explores the role that feedback based on past actions and motivational states of the learner can have in a motivationally and metacognitively aware Intelligent Tutoring ...
Alison Hull, Benedict du Boulay
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 1 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
WABI
2009
Springer
142views Bioinformatics» more  WABI 2009»
14 years 1 months ago
Back-Translation for Discovering Distant Protein Homologies
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
Marta Gîrdea, Laurent Noé, Gregory Ku...
COCOON
2009
Springer
14 years 1 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...