Sciweavers

23590 search results - page 4597 / 4718
» Algorithm Performance Contest
Sort
View
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
15 years 8 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny
136
Voted
KDD
1994
ACM
125views Data Mining» more  KDD 1994»
15 years 8 months ago
Knowledge Discovery in Large Image Databases: Dealing with Uncertainties in Ground Truth
This paper discusses the problem of knowledge discovery in image databases with particular focus on the issues which arise when absolute ground truth is not available. It is often...
Padhraic Smyth, Michael C. Burl, Usama M. Fayyad, ...
FOCS
1992
IEEE
15 years 8 months ago
On the Fault Tolerance of Some Popular Bounded-Degree Networks
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. ...
VLDB
1993
ACM
107views Database» more  VLDB 1993»
15 years 8 months ago
Recovering from Main-Memory Lapses
Recovery activities, like logging, checkpointing and restart, are used to restore a database to a consistent state after a system crash has occurred. Recovery related overhead is ...
H. V. Jagadish, Abraham Silberschatz, S. Sudarshan
185
Voted
POPL
1989
ACM
15 years 8 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
« Prev « First page 4597 / 4718 Last » Next »