Sciweavers

64 search results - page 3 / 13
» Efficient Computation in Groups Via Compression
Sort
View
CVPR
2009
IEEE
2305views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Visual tracking on the affine group via geometric particle filtering using optimal importance function
We propose a geometric method for visual tracking, in which the 2-D affine motion of a given object template is estimated in a video sequence by means of coordinateinvariant partic...
Junghyun Kwon (Seoul National University), Kyoung ...
ICIP
2004
IEEE
14 years 9 months ago
Efficient and reliable dynamic quality control for compression of compound document images
Compound images contain a mixture of natural images, text, and graphics. They need special care in the use of compression because text and graphics cannot withstand the significan...
Amir Said
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 19 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
IS
2008
13 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
14 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