Sciweavers

848 search results - page 64 / 170
» Randomness and the linear degrees of computability
Sort
View
ICML
2003
IEEE
16 years 19 days ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
BMCBI
2006
139views more  BMCBI 2006»
14 years 12 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
DCC
2008
IEEE
15 years 11 months ago
Compressive-Projection Principal Component Analysis for the Compression of Hyperspectral Signatures
A method is proposed for the compression of hyperspectral signature vectors on severely resourceconstrained encoding platforms. The proposed technique, compressive-projection prin...
James E. Fowler
CVPR
2008
IEEE
16 years 1 months ago
Re-thinking non-rigid structure from motion
We present a novel approach to non-rigid structure from motion (NRSFM) from an orthographic video sequence, based on a new interpretation of the problem. Existing approaches assum...
Vincent Rabaud, Serge Belongie
DEBS
2007
ACM
15 years 3 months ago
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
Gregory Chockler, Roie Melamed, Yoav Tock, Roman V...