Sciweavers

2127 search results - page 134 / 426
» Computing large matchings fast
Sort
View
CVPR
2010
IEEE
16 years 4 days ago
Unified Real-Time Tracking and Recognition with Rotation-Invariant Fast Features
We present a method that unifies tracking and video content recognition with applications to Mobile Augmented Reality (MAR). We introduce the Radial Gradient Transform (RGT) and ...
Gabriel Takacs, Vijay Chandrasekhar, Sam Tsai, Dav...
BMCBI
2010
129views more  BMCBI 2010»
15 years 4 months ago
The LabelHash Algorithm for Substructure Matching
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...
Mark Moll, Drew H. Bryant, Lydia E. Kavraki
RECOMB
2006
Springer
16 years 4 months ago
Simple and Fast Inverse Alignment
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
John D. Kececioglu, Eagu Kim
AAAI
2012
13 years 6 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
15 years 9 months ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd