Sciweavers

3360 search results - page 316 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 7 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
CIKM
2008
Springer
15 years 8 months ago
Workload-based optimization of integration processes
The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These inn proc...
Matthias Böhm, Uwe Wloka, Dirk Habich, Wolfga...
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 6 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer
TKDE
2012
192views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Discriminative Feature Selection by Nonparametric Bayes Error Minimization
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
Shuang-Hong Yang, Bao-Gang Hu
OPODIS
2010
15 years 4 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak