Sciweavers

3715 search results - page 743 / 743
» A Space Optimization for FP-Growth
Sort
View
TOG
2012
184views Communications» more  TOG 2012»
11 years 7 months ago
Image melding: combining inconsistent images using patch-based synthesis
Current methods for combining two different images produce visible artifacts when the sources have very different textures and structures. We present a new method for synthesizing...
Soheil Darabi, Eli Shechtman, Connelly Barnes, Dan...
CVPR
2012
IEEE
11 years 7 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 5 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
BMCBI
2005
108views more  BMCBI 2005»
13 years 5 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 7 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...