Sciweavers

3359 search results - page 418 / 672
» A Simplified Idea Algorithm
Sort
View
SIGIR
2010
ACM
14 years 7 months ago
Efficient partial-duplicate detection based on sequence matching
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
Qi Zhang, Yue Zhang, Haomin Yu, Xuanjing Huang
117
Voted
ICCV
2007
IEEE
16 years 2 months ago
Robust Image Registration using Mixtures of t-distributions
We propose a pixel similarity-based algorithm enabling accurate rigid registration between single and multimodal images presenting gross dissimilarities due to noise, missing data...
Demetrios Gerogiannis, Christophoros Nikou, Aristi...
200
Voted
POPL
2004
ACM
16 years 26 days ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 5 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
DGCI
2009
Springer
15 years 3 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso