994 search results - page 86 / 199 » Custom Computing Machines for the Set Covering Problem |
112
Voted
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
102
click to vote
ALT
2010
Springer
15 years 2 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
116
click to vote
ICCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
110
Voted
ICARCV
2002
IEEE
15 years 5 months ago
2002
IEEE
The focus of this work is on the problem of feature selection and classification for on-road vehicle detection. In particular, we propose using quantized Haar wavelet features an...
119
click to vote
HPCN
1998
Springer
15 years 4 months ago
1998
Springer
We describe the Paraflow system for connecting heterogeneous computing services together into a flexible and efficient data-mining metacomputer. There are three levels of parallel...