4110 search results - page 661 / 822 » Efficient algorithms for the 2-gathering problem |
139
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
158
click to vote
TSMC
2010
14 years 11 months ago
2010
In recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with c...
148
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
227
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
208
Voted
SIAMMAX
2010
14 years 11 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...