Sciweavers

12741 search results - page 112 / 2549
» Editorial and call for papers
Sort
View
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 10 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
IWFM
2003
15 years 7 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
HCI
2009
15 years 4 months ago
Responding to Learners' Cognitive-Affective States with Supportive and Shakeup Dialogues
This paper describes two affect-sensitive variants of an existing intelligent tutoring system called AutoTutor. The new versions of AutoTutor detect learners' boredom, confusi...
Sidney K. D'Mello, Scotty D. Craig, Karl Fike, Art...
KBSE
2006
IEEE
16 years 13 days ago
Detecting Precedence-Related Advice Interference
Aspect-Oriented Programming (AOP) has been proposed in literature to overcome modularization shortcomings such as the tyranny of the dominant decomposition. However, the new langu...
Maximilian Storzer, Florian Forster
PPOPP
2012
ACM
14 years 2 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank