Sciweavers

204 search results - page 28 / 41
» Powered Tate Pairing Computation
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
101
Voted
JGAA
2007
135views more  JGAA 2007»
14 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
BMCBI
2005
162views more  BMCBI 2005»
14 years 9 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
ECCC
2007
127views more  ECCC 2007»
14 years 9 months ago
Universal Semantic Communication I
Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant...
Brendan Juba, Madhu Sudan
ECCV
2006
Springer
15 years 11 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady