Sciweavers

10901 search results - page 350 / 2181
» Approximations in Distributed Optimization
Sort
View
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
16 years 7 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 7 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
16 years 1 months ago
Feature Selection for Value Function Approximation Using Bayesian Model Selection
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
Tobias Jung, Peter Stone
ICC
2008
IEEE
130views Communications» more  ICC 2008»
16 years 1 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
ICPR
2008
IEEE
16 years 1 months ago
Approximation of salient contours in cluttered scenes
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Rui Huang, Nong Sang, Qiling Tang