2314 search results - page 116 / 463 » Monoids over domains |
159
Voted
PACT
1999
Springer
15 years 6 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
133
click to vote
SIGOPSE
1994
ACM
15 years 5 months ago
1994
ACM
Application domains, such as multimedia, databases, and parallel computing, require operating system services with high performance and high functionality. Existing operating syst...
127
click to vote
DSD
2004
IEEE
15 years 5 months ago
2004
IEEE
In this paper we present an analysis of the minimal hardware precision required to implement Support Vector Machine (SVM) classification within a Logarithmic Number System archite...
97
Voted
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
121
Voted
IESA
2007
15 years 3 months ago
2007
In this paper we propose a new approach for service-oriented enterprise application integration (EAI). Unlike current EAI solutions, which mainly focus on technological aspects, ou...