Sciweavers

342 search results - page 64 / 69
» Matrix algebra and applicative programming
Sort
View
CSR
2008
Springer
13 years 9 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
CVPR
2009
IEEE
15 years 2 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...
ICML
2006
IEEE
14 years 8 months ago
Constructing informative priors using transfer learning
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...
Rajat Raina, Andrew Y. Ng, Daphne Koller
CDC
2008
IEEE
14 years 2 months ago
Shannon meets Bellman: Feature based Markovian models for detection and optimization
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...
Sean P. Meyn, George Mathew
IPPS
2003
IEEE
14 years 28 days ago
HMPI: Towards a Message-Passing Library for Heterogeneous Networks of Computers
The paper presents Heterogeneous MPI (HMPI), an extension of MPI for programming high-performance computations on heterogeneous networks of computers. It allows the application pr...
Alexey L. Lastovetsky, Ravi Reddy