Sciweavers

1403 search results - page 77 / 281
» Set cover algorithms for very large datasets
Sort
View
AIME
2007
Springer
15 years 4 months ago
An Intelligent Aide for Interpreting a Patient's Dialysis Data Set
Many machines used in the modern hospital settings offer real time physiological monitoring. Haemodialysis machines combine a therapeutic treatment system integrated with sophistic...
Derek H. Sleeman, Nick Fluck, Elias Gyftodimos, La...
ICDE
2005
IEEE
176views Database» more  ICDE 2005»
15 years 3 months ago
LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern
Sequence pattern mining is an important research problem because it is the basis of many other applications. Yet how to efficiently implement the mining is difficult due to the ...
Zhenglu Yang, Masaru Kitsuregawa
CIKM
2008
Springer
14 years 11 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han

Source Code
579views
15 years 5 months ago
The CImg Library
The CImg Library is an open source, C++ toolkit for image processing, designed with these properties in mind : Usefulness CImg defines classes and methods to manage images in y...
David Tschumperlé
COCOA
2008
Springer
14 years 11 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth