Sciweavers

219 search results - page 34 / 44
» Solving Semi-infinite Linear Programs Using Boosting-Like Me...
Sort
View
TIP
2008
175views more  TIP 2008»
13 years 7 months ago
Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...
Aswin C. Sankaranarayanan, Ankur Srivastava, Rama ...
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
SAC
2010
ACM
14 years 2 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
MOBIHOC
2006
ACM
14 years 7 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...