Sciweavers

2354 search results - page 218 / 471
» Randomness, Stochasticity and Approximations
Sort
View
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 7 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
AAAI
2007
15 years 6 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
115
Voted
INFOCOM
2008
IEEE
15 years 11 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
147
Voted
WCNC
2008
IEEE
15 years 11 months ago
A Closed-Form Approximation for Capacity of Multiuser MIMO Broadcast Systems: A Virtual User Approach
— Besides delivering high data rates in a point-to-point scenario, multi-input multi-output (MIMO) antenna techniques can broadcast personalized data to multiple users in the poi...
Li-Chun Wang, Chu-Jung Yeh, Chi-Fang Li
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 10 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen