Sciweavers

933 search results - page 65 / 187
» Monotone Complexity of a Pair
Sort
View
ECCV
2006
Springer
14 years 10 months ago
Aligning Sequences and Actions by Maximizing Space-Time Correlations
Abstract. We introduced an algorithm for sequence alignment, based on maximizing local space-time correlations. Our algorithm aligns sequences of the same action performed at diffe...
Yaron Ukrainitz, Michal Irani
CVPR
2012
IEEE
11 years 11 months ago
Active image clustering: Seeking constraints from humans to complement algorithms
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...
Arijit Biswas, David W. Jacobs
BMCBI
2006
113views more  BMCBI 2006»
13 years 9 months ago
In silico discovery of human natural antisense transcripts
Background: Several high-throughput searches for ppotential natural antisense transcripts (NATs) have been performed recently, but most of the reports were focused on cis type. A ...
Yuan-Yuan Li, Lei Qin, Zong-Ming Guo, Lei Liu, Hao...
CJ
2008
69views more  CJ 2008»
13 years 9 months ago
Some Parameterized Problems On Digraphs
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
Gregory Gutin, Anders Yeo
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 10 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie