2397 search results - page 202 / 480 » Applications of integer relation algorithms |
177
click to vote
IFIP12
2007
15 years 8 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
197
click to vote
RTSS
2007
IEEE
16 years 24 days ago
2007
IEEE
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
148
click to vote
MLDM
2007
Springer
16 years 20 days ago
2007
Springer
In this paper we show how frequent sequence mining (FSM) can be applied to data produced by monitoring distributed enterprise applications. In particular we show how we applied FSM...
160
click to vote
PPDP
2005
Springer
16 years 15 hour ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
174
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Trends in parallel computing indicate that heterogeneous parallel computing will be one of the most widespread platforms for computation-intensive applications. A heterogeneous com...