Sciweavers

2600 search results - page 88 / 520
» Clustering with or without the Approximation
Sort
View
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
15 years 6 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati
AAAI
2008
15 years 3 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan
TIP
2008
139views more  TIP 2008»
15 years 1 months ago
Parameter Estimation in TV Image Restoration Using Variational Distribution Approximation
In this paper, we propose novel algorithms for total variation (TV) based image restoration and parameter estimation utilizing variational distribution approximations. Within the h...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
14 years 11 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
ICML
2006
IEEE
16 years 2 months ago
An investigation of computational and informational limits in Gaussian mixture clustering
We investigate under what conditions clustering by learning a mixture of spherical Gaussians is (a) computationally tractable; and (b) statistically possible. We show that using p...
Nathan Srebro, Gregory Shakhnarovich, Sam T. Rowei...