Sciweavers

712 search results - page 7 / 143
» Sorting and selection on dynamic data
Sort
View
DKE
2000
75views more  DKE 2000»
13 years 7 months ago
Range queries in dynamic OLAP data cubes
A range query applies an aggregation operation (e.g., SUM) over all selected cells of an OLAP data cube where the selection is speci
Weifa Liang, Hui Wang, Maria E. Orlowska
ESOA
2006
13 years 11 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
SIMPRA
2008
74views more  SIMPRA 2008»
13 years 7 months ago
A model for simulating reputation dynamics in industrial districts
In this work we try to draw an interdisciplinary framework aimed to integrate a socio-cognitive approach with organizational research about industrial clusters, in order to invest...
Francesca Giardini, Gennaro di Tosto, Rosaria Cont...
ORL
2000
77views more  ORL 2000»
13 years 7 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb