Sciweavers

1393 search results - page 224 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
2002
IEEE
16 years 19 days ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
ICML
1999
IEEE
16 years 19 days ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
ICML
1999
IEEE
16 years 19 days ago
Detecting Motifs from Sequences
The problemofmultipleglobalcomparisonin familiesof biologicalsequences has been wellstudied. Fewer algorithms have been developed for identifying local consensus patterns or motif...
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler
WWW
2008
ACM
16 years 15 days ago
Efficiently finding web services using a clustering semantic approach
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
Jiangang Ma, Yanchun Zhang, Jing He
ALT
2009
Springer
15 years 8 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee