Sciweavers

1548 search results - page 273 / 310
» Data sharing between ada and C C
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 6 days ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
EDBT
2006
ACM
127views Database» more  EDBT 2006»
15 years 12 months ago
Progressive Query Optimization for Federated Queries
Federated queries are regular relational queries accessing data on one or more remote relational or non-relational data sources, possibly combining them with tables stored in the ...
Stephan Ewen, Holger Kache, Volker Markl, Vijaysha...
KCAP
2009
ACM
15 years 6 months ago
Biomedical knowledge engineering tools based on experimental design: a case study based on neuroanatomical tract-tracing experim
Curating information from the literature for storage in databases is a crucial task in biological research, and many groups assign a particular person or team to that process. We ...
Gully A. P. C. Burns, Thomas A. Russ
IPSN
2007
Springer
15 years 6 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
RTSS
2006
IEEE
15 years 5 months ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller