1066 search results - page 80 / 214 » Computing Private Set Operations with Linear Complexities |
TII
2010
14 years 4 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
ECOOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
105
click to vote
DEXA
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
IEEEPACT
2006
IEEE
15 years 3 months ago
2006
IEEE
In SMT processors, the complex interplay between private and shared datapath resources needs to be considered in order to realize the full performance potential. In this paper, we...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...