Sciweavers

6768 search results - page 1324 / 1354
» Developing Applications Using Model-Driven Design Environmen...
Sort
View
PPOPP
2012
ACM
13 years 10 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
111
Voted
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 2 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 3 months ago
How to Determine a Good Multi-Programming Level for External Scheduling
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar...
ICDE
2001
IEEE
167views Database» more  ICDE 2001»
16 years 3 months ago
Database Managed External File Update
RDBMS's have evolved to an extent that they are used to manage almost all of traditional business data in a robust fashion. Nevertheless, a large fraction of unstructured and...
Neeraj Mittal, Hui-I Hsiao
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 2 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
« Prev « First page 1324 / 1354 Last » Next »