Sciweavers

4114 search results - page 386 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
UAI
2004
15 years 8 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
ICIP
2003
IEEE
16 years 8 months ago
Object-based video compression scheme with optimal bit allocation among shape, motion and texture
In object-based video, the encoding of the video data is decoupled into the encoding of shape, motion and texture information, which enables certain functionalities like content-b...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
ICIP
2002
IEEE
16 years 8 months ago
Data rate smoothing in interactive walkthrough applications using 2D prefetching
Compared to a geometric approach, image based rendering applied to 3D view reconstruction doesn't require 3D model construction and doesn't depend on the complexity of t...
Vitali Zagorodnov, Peter J. Ramadge
SIGMOD
2009
ACM
147views Database» more  SIGMOD 2009»
16 years 7 months ago
XML keyword query refinement
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng M...
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
16 years 1 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...