Sciweavers

2463 search results - page 388 / 493
» Rankings of Directed Graphs
Sort
View
FLAIRS
2006
13 years 10 months ago
Using Enhanced Concept Map for Student Modeling in Programming Tutors
We have been using the concept map of the domain, enhanced with pedagogical concepts called learning objectives, as the overlay student model in our intelligent tutors for program...
Amruth N. Kumar
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
BIRTHDAY
2010
Springer
13 years 10 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
BMCBI
2007
118views more  BMCBI 2007»
13 years 9 months ago
A topological algorithm for identification of structural domains of proteins
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
Frank Emmert-Streib, Arcady R. Mushegian
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 9 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...