Sciweavers

1090 search results - page 44 / 218
» Problem Dependent Generalized Prewavelets
Sort
View
TCS
1998
13 years 8 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
ECML
2006
Springer
14 years 24 days ago
Improving Control-Knowledge Acquisition for Planning by Active Learning
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
Raquel Fuentetaja, Daniel Borrajo
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 7 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
STACS
1999
Springer
14 years 1 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
COR
2006
129views more  COR 2006»
13 years 9 months ago
Game-theoretic analysis of an ancient Chinese horse race problem
This paper analyzes a legendary Chinese horse race problem involving the King of Qi and General Tianji which took place more than 2000 years ago. In this problem each player owns ...
Mingming Leng, Mahmut Parlar