Sciweavers

1215 search results - page 65 / 243
» Dimensions of machine learning in design
Sort
View
COLT
2008
Springer
13 years 11 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
ISMB
1993
13 years 10 months ago
Representation for Discovery of Protein Motifs
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...
Darrell Conklin, Suzanne Fortier, Janice I. Glasgo...
MLDM
2010
Springer
13 years 3 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
ICMCS
2005
IEEE
109views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Ontology Design for Video Semantic Threads
We propose that, at the highest level of video understanding, the human needs for meaning and the methodologies to extract it are both universal and generic. One must develop an o...
John R. Kender, Milind R. Naphade
ECTEL
2009
Springer
14 years 1 months ago
The Conceptual and Architectural Design of a System Supporting Exploratory Learning of Mathematics Generalisation
Abstract. The MiGen project is designing and developing an intelligent, exploratory environment to support 11–14-year-old students in their learning of mathematical generalisatio...
Darren Pearce, Alexandra Poulovassilis