Sciweavers

73 search results - page 2 / 15
» Detecting the Learning Value of Items In a Randomized Proble...
Sort
View
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
14 years 1 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
ITS
2010
Springer
178views Multimedia» more  ITS 2010»
14 years 1 months ago
Learning What Works in ITS from Non-traditional Randomized Controlled Trial Data
The traditional, well established approach to finding out what works in education research is to run a randomized controlled trial (RCT) using a standard pretest and posttest desig...
Zachary A. Pardos, Matthew D. Dailey, Neil T. Heff...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
ICARIS
2005
Springer
14 years 2 months ago
A Comparative Study of Real-Valued Negative Selection to Statistical Anomaly Detection Techniques
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
Thomas Stibor, Jonathan Timmis, Claudia Eckert
RULEML
2004
Springer
14 years 1 months ago
Rule Learning for Feature Values Extraction from HTML Product Information Sheets
The Web is now a huge information repository with a rich semantic structure that, however, is primarily addressed to human understanding rather than automated processing by a compu...
Costin Badica, Amelia Badica