Sciweavers

13306 search results - page 463 / 2662
» Theoretical Computer Science
Sort
View
ITICSE
2005
ACM
16 years 1 months ago
Providing students universal access to a centralized, graphical computing environment
We investigate the use of a thin-client based configuration in providing students with universal access to a centralized, graphical computing environment. The primary goal is to ...
Michael H. Goldwasser, David Letscher
MFCS
2007
Springer
16 years 1 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
ITICSE
2004
ACM
16 years 1 months ago
Effective peer assessment for learning computer programming
Peer assessment is a technique that has been successfully employed in a variety of academic disciplines, and which is considered to be effective in developing student’s higher c...
Jirarat Sitthiworachart, Mike Joy
DIS
2007
Springer
16 years 1 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
MFCS
2005
Springer
16 years 1 months ago
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
Minming Li, Frances F. Yao