Sciweavers

1449 search results - page 81 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 10 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 10 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
163
Voted
MMB
2004
Springer
102views Communications» more  MMB 2004»
15 years 11 months ago
Improving the Timeliness of Rate Measurements
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...
Rüdiger Martin, Michael Menth
IJCAI
1997
15 years 7 months ago
Extracting Propositions from Trained Neural Networks
This paper presents an algorithm for extract­ ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Hiroshi Tsukimoto
161
Voted
TSP
2008
114views more  TSP 2008»
15 years 6 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer