Sciweavers

66 search results - page 6 / 14
» Documenting Programs Using a Library of Tree Structured Plan...
Sort
View
SIGCSE
2004
ACM
110views Education» more  SIGCSE 2004»
14 years 1 months ago
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...
PPOPP
2012
ACM
12 years 4 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ICDAR
2003
IEEE
14 years 1 months ago
SAGENT: A Novel Technique for Document Modeling for Secure Access and Distribution
A novel strategy for the representation and manipulation of distributed documents, potentially complex and heterogeneous, is presented in this paper. The document under the propos...
Sanaul Hoque, Hossam Selim, Gareth Howells, Michae...
BMCBI
2010
143views more  BMCBI 2010»
13 years 8 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
AI
2000
Springer
13 years 8 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...