Sciweavers

2925 search results - page 94 / 585
» Information Complexity of Online Problems
Sort
View
IUI
2005
ACM
15 years 11 months ago
Adaptive teaching strategy for online learning
Finding the optimal teaching strategy for an individual student is difficult even for an experienced teacher. Identifying and incorporating multiple optimal teaching strategies fo...
Jungsoon P. Yoo, Cen Li, Chrisila C. Pettey
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
15 years 9 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
FLAIRS
2004
15 years 7 months ago
Mining On-line Sources for Definition Knowledge
Finding definitions in huge text collections is a challenging problem, not only because of the many ways in which definitions can be conveyed in natural language texts but also be...
Horacio Saggion, Robert J. Gaizauskas
ICASSP
2011
IEEE
14 years 10 months ago
On-line Memory-Based Parametric Equalization to multimodal training conditions
This paper describes the conceptual and algorithmic evolutions of Memory Based Parametric Equalization (MPEQ) needed to exploit the potentialities of the method within the state-o...
Roberto Gemello, Franco Mana, Luz García, J...
FCT
2005
Springer
15 years 11 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...