Sciweavers

4536 search results - page 104 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
FCT
2001
Springer
14 years 1 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
TKDE
2002
168views more  TKDE 2002»
13 years 8 months ago
CLARANS: A Method for Clustering Objects for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
Raymond T. Ng, Jiawei Han
EDBT
2011
ACM
281views Database» more  EDBT 2011»
13 years 18 days ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 20 days ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
VLSISP
2008
147views more  VLSISP 2008»
13 years 7 months ago
Data Reuse Exploration for Low Power Motion Estimation Architecture Design in H.264 Encoder
Data access usually leads to more than 50% of the power cost in a modern signal processing system. To realize a low-power design, how to reduce the memory access power is a critica...
Yu-Han Chen, Tung-Chien Chen, Chuan-Yung Tsai, Sun...