2107 search results - page 89 / 422 » Computing Small Search Numbers in Linear Time |
130
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
115
click to vote
IJCAI
2003
15 years 4 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
101
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Linear Feedback Shift Registers (LFSRs) have always received considerable attention in computer science especially in coding theory and in cryptography. The scope of applications ...
148
click to vote
TIP
2008
15 years 3 months ago
2008
We consider the problem of recognizing 3-D objects from 2-D images using geometric models and assuming different viewing angles and positions. Our goal is to recognize and localize...
144
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...