Sciweavers

12052 search results - page 445 / 2411
» computing 2010
Sort
View
SIGCSE
2010
ACM
180views Education» more  SIGCSE 2010»
15 years 7 months ago
What do "CS1" and "CS2" mean?: investigating differences in the early courses
Thirty-one years ago, the ACM Computing Curricula used the terms "CS1" and "CS2" to designate the first two two courses in the introductory sequence of a compu...
Matthew Hertz
FUIN
2010
158views more  FUIN 2010»
15 years 4 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
15 years 7 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
COLING
2010
15 years 1 months ago
An Evaluation Framework for Plagiarism Detection
We present an evaluation framework for plagiarism detection.1 The framework provides performance measures that address the specifics of plagiarism detection, and the PAN-PC-10 cor...
Martin Potthast, Benno Stein, Alberto Barró...
ENDM
2006
96views more  ENDM 2006»
15 years 6 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...