Sciweavers

1091 search results - page 45 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 9 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
TDSC
2010
218views more  TDSC 2010»
13 years 6 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
TON
2012
11 years 10 months ago
Taming the Mobile Data Deluge With Drop Zones
—Human communication has changed by the advent of smartphones. Using commonplace mobile device features they started uploading large amounts of content that increases. This incre...
Ionut Trestian, Supranamaya Ranjan, Aleksandar Kuz...
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
14 years 1 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu
PPSC
1993
13 years 9 months ago
Parallel Preconditioning and Approximate Inverses on the Connection Machine
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
Marcus J. Grote, Horst D. Simon