Sciweavers

903 search results - page 95 / 181
» Non-well-founded trees in categories
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 6 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
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
16 years 29 days ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
KCAP
2003
ACM
15 years 11 months ago
Towards topic-based summarization for interactive document viewing
Our research aims at interactive document viewers that can select and highlight relevant text passages on demand. Another related objective is the generation of topic-specific su...
Achim G. Hoffmann, Son Bao Pham
CSB
2005
IEEE
192views Bioinformatics» more  CSB 2005»
16 years 35 min ago
RNAMute: RNA Secondary Structure Mutation Analysis Tool
RNAMute is an interactive web tool written in Java that calculates the secondary structure of all single point mutations, given an RNA sequence, and organizes them into categories...
Alexander Churkin, Ornit Elgad, Oshrat Petgho, Dan...
CVPR
2006
IEEE
16 years 8 months ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton