116 search results - page 9 / 24 » Implicit B-Trees: New Results for the Dictionary Problem |
CI
2007
14 years 10 months ago
2007
: When one tries to use the Web as a dictionary or encyclopedia, entering some single term into a search engine, the highly-ranked pages in the result can include irrelevant or use...
69
Voted
DMIN
2007
14 years 11 months ago
2007
—A new algorithm for minimal infrequent itemset mining is presented. Potential applications of finding infrequent itemsets include statistical disclosure risk assessment, bioinf...
TACS
2001
Springer
15 years 2 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
DAC
2005
ACM
15 years 11 months ago
2005
ACM
In this paper, we present a new linear-time retiming algorithm that produces near-optimal results. Our implementation is specifically targeted at Altera's Stratix [1] FPGAbas...
152
click to vote
ICCV
2011
IEEE
13 years 8 months ago
2011
IEEE
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...