Sciweavers

725 search results - page 72 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
A variational method for Bayesian blind image deconvolution
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
Aristidis Likas, Nikolas P. Galatsanos
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
14 years 11 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
CIKM
2009
Springer
15 years 4 months ago
Fast and effective histogram construction
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
15 years 10 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
VC
1998
66views more  VC 1998»
14 years 9 months ago
Vertex representations and their applications in computer graphics
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
Claudio Esperança, Hanan Samet