Sciweavers

598 search results - page 117 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
EUROGRAPHICS
2010
Eurographics
14 years 1 months ago
Articulated Billboards for Video-based Rendering
We present a novel representation and rendering method for free-viewpoint video of human characters based on multiple input video streams. The basic idea is to approximate the art...
Marcel Germann, Alexander Hornung, Richard Keiser,...
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 1 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
BIBM
2008
IEEE
217views Bioinformatics» more  BIBM 2008»
14 years 1 months ago
Combining Hierarchical Inference in Ontologies with Heterogeneous Data Sources Improves Gene Function Prediction
The study of gene function is critical in various genomic and proteomic fields. Due to the availability of tremendous amounts of different types of protein data, integrating thes...
Xiaoyu Jiang, Naoki Nariai, Martin Steffen, Simon ...
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
13 years 12 months ago
A Computational Approach to Reconstructing Gene Regulatory Networks
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
Xutao Deng, Hesham H. Ali