Sciweavers

5247 search results - page 429 / 1050
» Frequency Optimized Computation Methods
Sort
View
SIAMIS
2010
171views more  SIAMIS 2010»
14 years 10 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
133
Voted
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 1 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
GREC
2005
Springer
15 years 9 months ago
Online Composite Sketchy Shape Recognition Using Dynamic Programming
This paper presents a solution for online composite sketchy shape recognition. The kernel of the strategy treats both stroke segmentation and sketch recognition as an optimization ...
Zhengxing Sun, Bo Yuan, Jianfeng Yin
118
Voted
TWC
2010
14 years 10 months ago
A fixed-lag particle smoother for blind SISO equalization of time-varying channels
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...
Alberto Gaspar Guimarães, Boujemaa Ait-El-F...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 7 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve