Sciweavers

677 search results - page 123 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
85
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
15 years 10 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
159
Voted
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
15 years 9 months ago
Semantics and Evaluation Techniques for Window Aggregates in Data Streams
A windowed query operator breaks a data stream into possibly overlapping subsets of data and computes results over each. Many stream systems can evaluate window aggregate queries....
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...

Publication
353views
15 years 8 months ago
Shape from Shading with Perspective Projection
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
Kyoung Mu Lee (Seoul National University), C.-C. J...
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
15 years 6 months ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...