Sciweavers

315 search results - page 63 / 63
» Improving Performance by Branch Reordering
Sort
View
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
14 years 2 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...
ICS
1998
Tsinghua U.
13 years 11 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...
BMCBI
2010
74views more  BMCBI 2010»
13 years 7 months ago
A weighted q-gram method for glycan structure classification
Background: Glycobiology pertains to the study of carbohydrate sugar chains, or glycans, in a particular cell or organism. Many computational approaches have been proposed for ana...
Limin Li, Wai-Ki Ching, Takako Yamaguchi, Kiyoko F...
TAL
2010
Springer
13 years 5 months ago
Concept Based Representations for Ranking in Geographic Information Retrieval
Abstract. Geographic Information Retrieval (GIR) is a specialized Information Retrieval (IR) branch that deals with information related to geographical locations. Traditional IR en...
Maya Carrillo, Esaú Villatoro-Tello, Aureli...
ATAL
2011
Springer
12 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe