Sciweavers

1887 search results - page 370 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
JMLR
2010
117views more  JMLR 2010»
13 years 2 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach
EUROSYS
2007
ACM
14 years 4 months ago
Tashkent+: memory-aware load balancing and update filtering in replicated databases
We present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets ...
Sameh Elnikety, Steven G. Dropsho, Willy Zwaenepoe...
JPDC
2008
217views more  JPDC 2008»
13 years 7 months ago
Parallel techniques for information extraction from hyperspectral imagery using heterogeneous networks of workstations
Recent advances in space and computer technologies are revolutionizing the way remotely sensed data is collected, managed and interpreted. In particular, NASA is continuously gath...
Antonio J. Plaza
ICDIM
2010
IEEE
13 years 5 months ago
Data mining and automatic OLAP schema generation
Data mining aims at extraction of previously unidentified information from large databases. It can be viewed as an automated application of algorithms to discover hidden patterns a...
Muhammad Usman, Sohail Asghar, Simon Fong