Sciweavers

1632 search results - page 89 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
FOIKS
2008
Springer
16 years 16 days ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
137
Voted
DISOPT
2007
155views more  DISOPT 2007»
15 years 3 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
129
Voted
AIA
2006
15 years 5 months ago
Efficient Algorithm for Calculating Similarity between Trajectories Containing an Increasing Dimension
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
Perttu Laurinen, Pekka Siirtola, Juha Röning
132
Voted
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 3 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
116
Voted
CSB
2004
IEEE
15 years 7 months ago
Space-Conserving Optimal DNA-Protein Alignment
DNA-protein alignment algorithms can be used to discover coding sequences in a genomic sequence, if the corresponding protein derivatives are known. They can also be used to ident...
Pang Ko, Mahesh Narayanan, Anantharaman Kalyanaram...