Sciweavers

2569 search results - page 80 / 514
» Approximate Objects and Approximate Theories
Sort
View
COMGEO
1999
ACM
15 years 6 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
ICPR
2010
IEEE
15 years 5 months ago
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
Manuel Igelmo, Alberto Sanfeliu, Miquel Ferrer
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 10 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
UAI
1997
15 years 7 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...