2168 search results - page 385 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
104
Voted
DISCEX
2003
IEEE
15 years 8 months ago
2003
IEEE
Dealing with damage that arises during operation of networked information systems is essential if such systems are to provide the dependability required by modern critical applica...
100
Voted
ICDAR
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper proposes a simple voting scheme for off-line recognition of handprinted numerals. One of the main features of the proposed scheme is that this is not script dependent. ...
126
Voted
FM
2001
Springer
15 years 8 months ago
2001
Springer
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
141
click to vote
FCCM
2007
IEEE
15 years 5 months ago
2007
IEEE
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
148
click to vote
FIMI
2003
15 years 4 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...