4903 search results - page 304 / 981 » The Set Covering Machine |
172
Voted
DAC
1994
ACM
15 years 11 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
180
click to vote
CASES
2005
ACM
15 years 8 months ago
2005
ACM
This paper presents a methodology for monitoring security in Application Specific Instruction-set Processors (ASIPs). This is a generalized methodology for inline monitoring insec...
164
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
167
click to vote
MST
2000
15 years 6 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
208
click to vote
IJBRA
2010
15 years 4 months ago
2010
This paper explores the scalability issues associated with solving the Named Entity Recognition (NER) problem using Support Vector Machines (SVM) and high-dimensional features and ...