Sciweavers

153 search results - page 15 / 31
» Fast and effective histogram construction
Sort
View
VLDB
2001
ACM
144views Database» more  VLDB 2001»
15 years 10 months ago
Approximate query processing using wavelets
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev ...
GLOBECOM
2006
IEEE
15 years 3 months ago
Fast Packet Classification using Group Bit Vector
—Packet classification is important in fulfilling the requirements of new services such as policy-based routing in next generation networks. In this paper, we propose a novel bit...
Tong Liu, Huawei Li, Xiaowei Li, Yinhe Han
82
Voted
BMCBI
2004
208views more  BMCBI 2004»
14 years 9 months ago
Hybrid clustering for microarray image analysis combining intensity and shape features
Background: Image analysis is the first crucial step to obtain reliable results from microarray experiments. First, areas in the image belonging to single spots have to be identif...
Jörg Rahnenführer, Daniel Bozinov
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 9 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
65
Voted
TCSV
2008
124views more  TCSV 2008»
14 years 9 months ago
A Block-Edge-Pattern-Based Content Descriptor in DCT Domain
In this correspondence, we describe a robust and effective content descriptor based on block edge patterns extracted directly in DCT domain, which is suitable for applications in J...
Jianmin Jiang, Kaijin Qiu, Guoqiang Xiao