Sciweavers

5169 search results - page 22 / 1034
» Locality approximation using time
Sort
View
EACL
2009
ACL Anthology
14 years 8 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
TROB
2008
154views more  TROB 2008»
13 years 5 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
DCC
1996
IEEE
13 years 11 months ago
Arbitrary Tilings of the Time-Frequency Plane Using Local Bases
We show how to design filters given a prescribed tiling of the time
Riccardo Bernardini, Jelena Kovacevic
VLSID
2005
IEEE
150views VLSI» more  VLSID 2005»
14 years 7 months ago
Multivariate Normal Distribution Based Statistical Timing Analysis Using Global Projection and Local Expansion
This paper employs general multivariate normal distribution to develop a new efficient statistical timing analysis methodology. The paper presents the theoretical framework of the...
Baohua Wang, Pinaki Mazumder
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
14 years 1 months ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi