Sciweavers

8294 search results - page 236 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
15 years 11 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
CVPR
2007
IEEE
16 years 8 months ago
Beyond Local Appearance: Category Recognition from Pairwise Interactions of Simple Features
We present a discriminative shape-based algorithm for object category localization and recognition. Our method learns object models in a weakly-supervised fashion, without requiri...
Marius Leordeanu, Martial Hebert, Rahul Sukthankar
ACL
2007
15 years 8 months ago
An Ensemble Method for Selection of High Quality Parses
While the average performance of statistical parsers gradually improves, they still attach to many sentences annotations of rather low quality. The number of such sentences grows ...
Roi Reichart, Ari Rappoport
BMCBI
2006
147views more  BMCBI 2006»
15 years 6 months ago
A hidden Markov model approach for determining expression from genomic tiling micro arrays
Background: Genomic tiling micro arrays have great potential for identifying previously undiscovered coding as well as non-coding transcription. To-date, however, analyses of thes...
Kasper Munch, Paul P. Gardner, Peter Arctander, An...
BMCBI
2007
179views more  BMCBI 2007»
15 years 6 months ago
Gene selection with multiple ordering criteria
Background: A microarray study may select different differentially expressed gene sets because of different selection criteria. For example, the fold-change and p-value are two co...
James J. Chen, Chen-An Tsai, ShengLi Tzeng, Chun-H...