Sciweavers

4114 search results - page 141 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
157
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
VLDB
2007
ACM
102views Database» more  VLDB 2007»
16 years 6 months ago
Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
Fei Xu, Chris Jermaine
CCR
1998
75views more  CCR 1998»
15 years 5 months ago
A comparative analysis of groupware application protocols
Two of the most difficult problems faced by developers of synchronous groupware applications are the handling of multiple session connections and the maintenance of replicated dat...
Mark Pendergast
ADC
2010
Springer
266views Database» more  ADC 2010»
15 years 1 months ago
Counting distinct objects over sliding windows
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, X...
WSC
1998
15 years 7 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill