Sciweavers

10414 search results - page 274 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
16 years 7 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
ICDE
2006
IEEE
150views Database» more  ICDE 2006»
16 years 7 months ago
Efficient Aggregation of Ranked Inputs
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, Davi...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 7 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
SIGMOD
2005
ACM
97views Database» more  SIGMOD 2005»
16 years 6 months ago
Incognito: Efficient Full-Domain K-Anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes that clearly identify individuals, such as Name and So...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
SIPS
2008
IEEE
16 years 27 days ago
Efficient image reconstruction using partial 2D Fourier transform
In this paper we present an efficient way of doing image reconstruction using the 2D Discrete Fourier transform (DFT). We exploit the fact that in the frequency domain, informati...
Lanping Deng, Chi-Li Yu, Chaitali Chakrabarti, Jun...