Sciweavers

1033 search results - page 116 / 207
» The Relative History Heuristic
Sort
View
AIED
2007
Springer
16 years 18 days ago
Helping Courseware Authors to Build Ontologies: The Case of TM4L
The authors of topic map-based learning resources face major difficulties in constructing the underlying ontologies. In this paper we propose two approaches to address this problem...
Darina Dicheva, Christo Dichev
KIVS
2007
Springer
16 years 16 days ago
Dynamic Algorithms in Multi-user OFDM Wireless Cells
This paper presents several results on dynamic OFDMA systems. It addresses especially the algorithmic complexity involved with several resource allocation approaches, sub-optimal h...
James Gross
LION
2007
Springer
138views Optimization» more  LION 2007»
16 years 16 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
ICDM
2006
IEEE
182views Data Mining» more  ICDM 2006»
16 years 14 days ago
Active Learning to Maximize Area Under the ROC Curve
In active learning, a machine learning algorithm is given an unlabeled set of examples U, and is allowed to request labels for a relatively small subset of U to use for training. ...
Matt Culver, Kun Deng, Stephen D. Scott
IDEAS
2006
IEEE
82views Database» more  IDEAS 2006»
16 years 13 days ago
A similarity based approach for integrated Web caching and content replication in CDNs
Web caching and content replication techniques emerged to solve performance problems related to the Web. We propose a generic non-parametric heuristic method that integrates both ...
Konstantinos Stamos, George Pallis, Charilaos Thom...