1091 search results - page 44 / 219 » Approximation Algorithms for Data Placement Problems |
256
click to vote
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
126
click to vote
SDM
2003
SIAM
15 years 3 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
134
click to vote
AGI
2008
15 years 3 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
109
Voted
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
247
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...