Sciweavers

594 search results - page 96 / 119
» Using Approximation to Relate Computational Classes over the...
Sort
View
WACV
2005
IEEE
14 years 2 months ago
Epipolar Constraints for Vision-Aided Inertial Navigation
— This paper describes a new method to improve inertial navigation using feature-based constraints from one or more video cameras. The proposed method lengthens the period of tim...
David D. Diel, Paul DeBitetto, Seth J. Teller
BMCBI
2007
159views more  BMCBI 2007»
13 years 8 months ago
Detecting differential expression in microarray data: comparison of optimal procedures
Background: Many procedures for finding differentially expressed genes in microarray data are based on classical or modified t-statistics. Due to multiple testing considerations, ...
Elena Perelman, Alexander Ploner, Stefano Calza, Y...
PODC
2004
ACM
14 years 2 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 11 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
ECCV
2002
Springer
14 years 10 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel