2223 search results - page 100 / 445 » Ontological Framework for Approximation |
390
click to vote
SDM
2011
SIAM
14 years 10 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
178
click to vote
FINTAL
2006
15 years 11 months ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
233
click to vote
UAI
2000
15 years 8 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
166
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
192
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...