Sciweavers

1091 search results - page 125 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
14 years 9 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
AAAI
2007
13 years 10 months ago
Isometric Projection
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
Deng Cai, Xiaofei He, Jiawei Han
VLSID
2008
IEEE
83views VLSI» more  VLSID 2008»
14 years 8 months ago
Efficient Linear Macromodeling via Discrete-Time Time-Domain Vector Fitting
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
Chi-Un Lei, Ngai Wong
CSDA
2006
84views more  CSDA 2006»
13 years 8 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans