Sciweavers

1268 search results - page 200 / 254
» An Algorithm for Distributed Beacon Selection
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 6 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
CASCON
2001
148views Education» more  CASCON 2001»
15 years 3 months ago
A Pareto model for OLAP view size estimation
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...
Thomas P. Nadeau, Toby J. Teorey
DEBU
2010
128views more  DEBU 2010»
14 years 11 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
GIS
2005
ACM
16 years 2 months ago
In-network surface simplification for sensor fields
Recent research literature on sensor network databases has focused on finding ways to perform in-network aggregation of sensor readings to reduce the message cost. However, with t...
Brian Harrington, Yan Huang
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 2 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker