Sciweavers

1536 search results - page 58 / 308
» Approximately Dominating Representatives
Sort
View
152
Voted
VC
2008
88views more  VC 2008»
15 years 4 months ago
Evolution of T-spline level sets for meshing non-uniformly sampled and incomplete data
Given a large set of unorganized point sample data, we propose a new framework for computing a triangular mesh representing an approximating piecewise smooth surface. The data may ...
Huaiping Yang, Bert Jüttler
ICML
2004
IEEE
16 years 5 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
VLDB
2005
ACM
104views Database» more  VLDB 2005»
15 years 10 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...
NIPS
2007
15 years 6 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
119
Voted
IJAR
2008
167views more  IJAR 2008»
15 years 4 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman