109 search results - page 14 / 22 » dm 2007 |
103
click to vote
FGCS
2007
14 years 10 months ago
2007
Grid Computing brought the promise of making high-performance computing cheaper and more easily available than traditional supercomputing platforms. Such a promise was very well r...
108
click to vote
ESANN
2004
14 years 11 months ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
DM
2007
14 years 10 months ago
2007
In this note we continue the study of gaps in samples of geometric random variables originated in Hitczenko and Knopfmacher [Gap-free compositions and gap-free samples of geometri...
DM
2007
14 years 10 months ago
2007
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
DM
2007
14 years 10 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...