12741 search results - page 314 / 2549 » Editorial and call for papers |
166
click to vote
CDES
2008
15 years 8 months ago
2008
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
170
click to vote
DAIS
2007
15 years 8 months ago
2007
The present emergence of loosely-coupled, inter-enterprise collaboration, i.e., virtual organizations calls for new kind of middleware: generic, common facilities for managing cont...
162
Voted
LREC
2010
15 years 8 months ago
2010
In this paper we will present work carried out to scale up the system for text understanding called GETARUNS, and port it to be used in dialogue understanding. The current goal is...
186
click to vote
DIMVA
2008
15 years 8 months ago
2008
Abstract. Stealthy malware, such as botnets and spyware, are hard to detect because their activities are subtle and do not disrupt the network, in contrast to DoS attacks and aggre...
186
click to vote
DLT
2008
15 years 8 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...