Sciweavers

252 search results - page 27 / 51
» Efficient Algorithms for Minimizing Cross Validation Error
Sort
View
MST
2006
120views more  MST 2006»
13 years 8 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
SSWMC
2004
13 years 10 months ago
Hiding correlation-based watermark templates using secret modulation
A possible solution to the difficult problem of geometrical distortion of watermarked images in a blind watermarking scenario is to use a template grid in the autocorrelation func...
Jeroen Lichtenauer, Iwan Setyawan, Reginald L. Lag...
COMAD
2008
13 years 10 months ago
CUM: An Efficient Framework for Mining Concept Units
Web is the most important repository of different kinds of media such as text, sound, video, images etc. Web mining is the process of applying data mining techniques to automatica...
Santhi Thilagam
APGV
2006
ACM
144views Visualization» more  APGV 2006»
14 years 13 days ago
Efficient selective rendering of participating media
Realistic image synthesis is the process of computing photorealistic images which are perceptually and measurably indistinguishable from real-world images. In order to obtain high...
Oscar Anson, Veronica Sundstedt, Diego Gutierrez, ...
INFOCOM
2002
IEEE
14 years 1 months ago
Optimal on-line estimation of the size of a dynamic multicast group
Abstract—In this paper we propose an efficient on-line estimation algorithm for determining the size of a dynamic multicast group. By using diffusion approximation and Kalman ...
Sara Alouf, Eitan Altman, Philippe Nain