Sciweavers

820 search results - page 89 / 164
» Finding low-utility data structures
Sort
View
DAWAK
2006
Springer
14 years 15 days ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 6 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
MICCAI
2008
Springer
14 years 10 months ago
Discovering Modes of an Image Population through Mixture Modeling
Abstract. We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The out...
Mert R. Sabuncu, Serdar K. Balci, Polina Golland
HICSS
2006
IEEE
155views Biometrics» more  HICSS 2006»
14 years 2 months ago
Contextualizing Knowledge Management Readiness to Support Change Management Strategies
Research on knowledge management (KM) readiness has matured. However, recent organizational structures have emerged which prevent traditional instruments from adequately measuring...
Mark Keith, Michael Goul, Haluk Demirkan, Jason Ni...
TOOLS
1999
IEEE
14 years 1 months ago
Interaction Schemata: Compiling Interactions to Code
Programming object interactions is at the heart of object-oriented programming. To improve reusability of the interactions, it is important to program object interactions generica...
Neeraj Sangal, Edward Farrell, Karl J. Lieberherr,...