Sciweavers

515 search results - page 54 / 103
» A Reduced Complexity Algorithm for Minimizing N-Detect Tests
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
IJNM
2008
103views more  IJNM 2008»
13 years 8 months ago
An efficient architecture for Bandwidth Brokers in DiffServ networks
In this article we examine the architecture of an entity used for automatic management and provisioning of resources for DiffServ networks. We examine the existing literature and ...
Christos Bouras, Kostas Stamos
ICIP
2002
IEEE
14 years 10 months ago
Visualization of high dynamic range images
A novel paradigm for information visualization in high dynamic range images is presented in this paper. These images, real or synthetic, have luminance with typical ranges many or...
Alvaro Pardo, Guillermo Sapiro
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
14 years 2 months ago
Sparse appearance based modeling for robot localization
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
Olaf Booij, Zoran Zivkovic, Ben J. A. Kröse
UAI
2008
13 years 10 months ago
Refractor Importance Sampling
In this paper we introduce Refractor Importance Sampling (RIS), an improvement to reduce error variance in Bayesian network importance sampling propagation under evidential reason...
Haohai Yu, Robert van Engelen