Sciweavers

1791 search results - page 16 / 359
» Policy-Driven Management of Data Sets
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
EUROSYS
2011
ACM
12 years 12 months ago
SRM-buffer: an OS buffer management technique to prevent last level cache from thrashing in multicores
Buffer caches in operating systems keep active file blocks in memory to reduce disk accesses. Related studies have been focused on how to minimize buffer misses and the caused pe...
Xiaoning Ding, Kaibo Wang, Xiaodong Zhang
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
13 years 4 days ago
Power management of online data-intensive services
Much of the success of the Internet services model can be attributed to the popularity of a class of workloads that we call Online Data-Intensive (OLDI) services. These workloads ...
David Meisner, Christopher M. Sadler, Luiz Andr&ea...
JUCS
2010
124views more  JUCS 2010»
13 years 3 months ago
A Tool for Managing Domain Knowledge and Helping Tutors in Intelligent Tutoring Systems
: Intelligent Tutoring Systems (ITSs) constitute a popular type of intelligent educational systems. Domain Knowledge (DK) is a basic part of an ITS and usually includes information...
Panayiotis Kyriakou, Ioannis Hatzilygeroudis, John...
TOIS
2002
97views more  TOIS 2002»
13 years 8 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams