Sciweavers

234 search results - page 28 / 47
» On the relative complexity of approximate counting problems
Sort
View
HAPTICS
2008
IEEE
13 years 8 months ago
Haptic Interaction with Soft Tissues Based on State-Space Approximation
The well known property of haptic interaction is the high refresh rate of the haptic loop that is necessary for the stability of the interaction. Therefore, only simple computation...
Igor Peterlík, Ludek Matyska
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 9 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 7 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
RSFDGRC
2005
Springer
127views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
Hierarchical Information Maps
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
Andrzej Skowron, Piotr Synak