Sciweavers

1195 search results - page 107 / 239
» What, Where
Sort
View
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 11 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 9 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan
SIGMOD
2006
ACM
156views Database» more  SIGMOD 2006»
14 years 9 months ago
Data delivery in a service-oriented world: the BEA aquaLogic data services platform
"Wow. I fell asleep listening to SOA music, and when I woke up, I couldn't remember where I'd put my data. Now what?" Has this happened to you? With the new pu...
Michael J. Carey
ECML
2005
Springer
14 years 2 months ago
Simple Test Strategies for Cost-Sensitive Decision Trees
We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that ...
Shengli Sheng, Charles X. Ling, Qiang Yang
ICPADS
2002
IEEE
14 years 1 months ago
Performance Evaluation of Distributed Computing Paradigms in Mobile Ad Hoc Sensor Networks
The emergence of mobile ad hoc sensor networks has brought new challenges to traditional network design. This paper focuses on the study at the application layer. In specific, it...
Yingyue Xu, Hairong Qi