3818 search results - page 14 / 764 » Word Problems on Compressed Words |
97
Voted
CADE
2012
Springer
13 years 2 days ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
AAECC
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of th...
ACL
2012
13 years 2 days ago
2012
We present a novel extension to a recently proposed incremental learning algorithm for the word segmentation problem originally introduced in Goldwater (2006). By adding rejuvenat...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...