Sciweavers

790 search results - page 111 / 158
» Extensible Data Management in the Middle-Tier
Sort
View
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 9 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 9 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
SOSP
2009
ACM
14 years 6 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
CJ
1999
80views more  CJ 1999»
13 years 8 months ago
Resolving Executing-Committing Conflicts in Distributed Real-time Database Systems
In a distributed real-time database system (DRTDBS), a commit protocol is required to ensure transaction failure atomicity. If data conflicts occur between executing and committin...
Kam-yiu Lam, Chung-Leung Pang, Sang Hyuk Son, Jian...
SIGMOD
2005
ACM
177views Database» more  SIGMOD 2005»
14 years 9 months ago
An approach for pipelining nested collections in scientific workflows
We describe an approach for pipelining nested data collections in scientific workflows. Our approach logically delimits arbitrarily nested collections of data tokens using special...
Timothy M. McPhillips, Shawn Bowers