Sciweavers

1615 search results - page 74 / 323
» Computer science and decision theory
Sort
View
GRC
2005
IEEE
14 years 2 months ago
Discovering and ranking important rules
— Decision rules generated from reducts can fully describe a data set. We introduce a new method of evaluating rules by taking advantage of rough sets theory. We consider rules g...
Jiye Li, Nick Cercone
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 6 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
SIGCSE
2009
ACM
143views Education» more  SIGCSE 2009»
14 years 3 months ago
Thinking about computational thinking
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
James J. Lu, George H. L. Fletcher
FOCS
2005
IEEE
14 years 2 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
ITICSE
2006
ACM
14 years 2 months ago
Fast application development to demonstrate computer graphics concepts
Computer graphics concepts have a high visual component. For that reason, teaching this subject should be enriched with the use of small applications showing concepts like near an...
Pedro Pablo Gómez-Martín, Marco Anto...