Sciweavers

102 search results - page 7 / 21
» Set systems without a simplex or a cluster
Sort
View
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
15 years 3 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
EKAW
2000
Springer
15 years 1 months ago
Informed Selection of Training Examples for Knowledge Refinement
Knowledge refinement tools rely on a representative set of training examples to identify and repair faults in a knowledge based system (KBS). In real environments it is often diffi...
Nirmalie Wiratunga, Susan Craw
108
Voted
ISPAN
2005
IEEE
15 years 3 months ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
75
Voted
MIR
2003
ACM
174views Multimedia» more  MIR 2003»
15 years 2 months ago
Content-based image retrieval by clustering
In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high fea...
Yixin Chen, James Ze Wang, Robert Krovetz
87
Voted
SOSP
2009
ACM
15 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...