Sciweavers

3656 search results - page 110 / 732
» Compact Location Problems
Sort
View
ICIP
2007
IEEE
16 years 2 months ago
Dominant Color Structure Descriptor for Image Retrieval
-- A new Dominant Color Structure Descriptor (DCSD) is proposed in this paper. It is designed to provide an efficient way to represent both color and spatial structure information ...
Ka-Man Wong, Lai-Man Po, Kwok-Wai Cheung
95
Voted
NIPS
1994
15 years 2 months ago
Reinforcement Learning with Soft State Aggregation
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
98
Voted
RAS
2007
102views more  RAS 2007»
15 years 7 days ago
Fast and accurate SLAM with Rao-Blackwellized particle filters
Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each ...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
DAC
1996
ACM
15 years 4 months ago
Stochastic Sequential Machine Synthesis Targeting Constrained Sequence Generation
- The problem of stochastic sequential machines (SSM) synthesis is addressed and its relationship with the constrained sequence generation problem which arises during power estimat...
Diana Marculescu, Radu Marculescu, Massoud Pedram
186
Voted
COCOA
2011
Springer
14 years 16 days ago
The Complexity of Testing Monomials in Multivariate Polynomials
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
Zhixiang Chen, Bin Fu