Sciweavers

3360 search results - page 299 / 672
» Opportunistic Data Structures with Applications
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 5 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
SBCCI
2009
ACM
188views VLSI» more  SBCCI 2009»
15 years 11 months ago
Low-power inter-core communication through cache partitioning in embedded multiprocessors
We present an application-driven customization methodology for energy-efficient inter-core communication in embedded multiprocessors. The methodology leverages configurable cach...
Chenjie Yu, Xiangrong Zhou, Peter Petrov
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 6 months ago
Spatial Outsourcing for Location-based Services
- The embedding of positioning capabilities in mobile devices and the emergence of location-based applications have created novel opportunities for utilizing several types of multi...
Yin Yang, Stavros Papadopoulos, Dimitris Papadias,...
ICDE
2005
IEEE
121views Database» more  ICDE 2005»
16 years 6 months ago
Top-Down Specialization for Information and Privacy Preservation
Releasing person-specific data in its most specific state poses a threat to individual privacy. This paper presents a practical and efficient algorithm for determining a generaliz...
Benjamin C. M. Fung, Ke Wang, Philip S. Yu
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
16 years 6 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou