Sciweavers

4212 search results - page 238 / 843
» On Compressible Pairings and Their Computation
Sort
View
FCT
1991
Springer
15 years 10 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
TFCV
1994
15 years 8 months ago
Attentive Visual Motion Processing: Computations in the Log-Polar Plane
Attentive vision is characterized by selective sensing in space and time as well as selective processing with respect to a speci c task. Selection in space involves the splitting ...
Konstantinos Daniilidis
INDIASE
2009
ACM
16 years 1 months ago
Computing dynamic clusters
When trying to reverse engineer software, execution trace analysis is increasingly used. Though, by using this technique we are quickly faced with an enormous amount of data that ...
Philippe Dugerdil, Sebastien Jossi
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
16 years 8 months ago
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
15 years 11 months ago
On Computing Condensed Frequent Pattern Bases
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han