Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Birdwatching is one of the very interesting hobbies and most important work. Many birdwatching assistant systems have been developed. However, most of them do not have any intelli...
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
Maximum entropy (Maxent) is useful in natural language processing and many other areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With...