Sciweavers

1263 search results - page 94 / 253
» A* with Bounded Costs
Sort
View
TSP
2010
15 years 29 days ago
Double sparsity: learning sparse dictionaries for sparse signal approximation
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
Ron Rubinstein, Michael Zibulevsky, Michael Elad
MCU
2007
95views Hardware» more  MCU 2007»
15 years 7 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud
CORR
2007
Springer
91views Education» more  CORR 2007»
15 years 6 months ago
Classical Interaction Cannot Replace a Quantum Message
We demonstrate a two-player communication problem that can be solved in the oneway quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communicat...
Dmitry Gavinsky
SOFTWARE
2002
15 years 6 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni
WWW
2007
ACM
16 years 7 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham