Sciweavers

3874 search results - page 536 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 5 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
ICDE
2007
IEEE
136views Database» more  ICDE 2007»
16 years 6 months ago
Norm, Point, and Distance Estimation Over Multiple Signals Using Max-Stable Distributions
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
Stilian Stoev, Marios Hadjieleftheriou, George Kol...
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 6 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
ICPR
2006
IEEE
16 years 5 months ago
Control Double Inverted Pendulum by Reinforcement Learning with Double CMAC Network
To accelerate the learning of reinforcement learning, many types of function approximation are used to represent state value. However function approximation reduces the accuracy o...
Siwei Luo, Yu Zheng, Ziang Lv
135
Voted
ICPR
2004
IEEE
16 years 5 months ago
Classification Probability Analysis of Principal Component Null Space Analysis
In a previous paper [1], we have presented a new linear classification algorithm, Principal Component Null Space Analysis (PCNSA) which is designed for problems like object recogn...
Namrata Vaswani, Rama Chellappa