Sciweavers

3270 search results - page 153 / 654
» Approximate String Processing
Sort
View
WSC
2004
15 years 3 months ago
Exploiting Temporal Uncertainty in Process-Oriented Distributed Simulations
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...
Margaret L. Loper, Richard M. Fujimoto
AAAI
1990
15 years 3 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
ACL
2009
15 years 8 days ago
A Note on the Implementation of Hierarchical Dirichlet Processes
The implementation of collapsed Gibbs samplers for non-parametric Bayesian models is non-trivial, requiring considerable book-keeping. Goldwater et al. (2006a) presented an approx...
Phil Blunsom, Trevor Cohn, Sharon Goldwater, Mark ...
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
15 years 8 months ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
SADM
2008
178views more  SADM 2008»
15 years 1 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon