Sciweavers

6045 search results - page 116 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
AIED
2007
Springer
14 years 2 months ago
Comparing Linguistic Features for Modeling Learning in Computer Tutoring
We compare the relative utility of different automatically computable linguistic feature sets for modeling student learning in computer dialogue tutoring. We use the PARADISE frame...
Katherine Forbes-Riley, Diane J. Litman, Amruta Pu...
MICCAI
2005
Springer
14 years 1 months ago
Brain Shift Computation Using a Fully Nonlinear Biomechanical Model
Abstract. In the present study, fully nonlinear (i.e. accounting for both geometric and material nonlinearities) patient specific finite element brain model was applied to predict ...
Adam Wittek, Ron Kikinis, Simon K. Warfield, Karol...
AUTOMATICA
2011
12 years 11 months ago
Fast computation of minimal elementary decompositions of metabolic flux vectors
The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector ca...
Raphaël M. Jungers, Francisca Zamorano, Vince...
CADE
2002
Springer
14 years 8 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg