Sciweavers

2223 search results - page 370 / 445
» Ontological Framework for Approximation
Sort
View
ICCV
2005
IEEE
15 years 6 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
115
Voted
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
15 years 6 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
117
Voted
SIGIR
2005
ACM
15 years 6 months ago
Personalizing search via automated analysis of interests and activities
We formulate and study search algorithms that consider a user’s prior interactions with a wide variety of content to personalize that user’s current Web search. Rather than re...
Jaime Teevan, Susan T. Dumais, Eric Horvitz
ECML
2005
Springer
15 years 6 months ago
Using Rewards for Belief State Updates in Partially Observable Markov Decision Processes
Partially Observable Markov Decision Processes (POMDP) provide a standard framework for sequential decision making in stochastic environments. In this setting, an agent takes actio...
Masoumeh T. Izadi, Doina Precup
94
Voted
FPL
2005
Springer
98views Hardware» more  FPL 2005»
15 years 6 months ago
Using DSP Blocks For ROM Replacement: A Novel Synthesis Flow
This paper describes a method based on polynomial approximation for transferring ROM resources used in FPGA designs to multiplication and addition operations. The technique can be...
Gareth W. Morris, George A. Constantinides, Peter ...