Sciweavers

18451 search results - page 3625 / 3691
» Selecting the
Sort
View
PVLDB
2010
159views more  PVLDB 2010»
13 years 7 months ago
Explore or Exploit? Effective Strategies for Disambiguating Large Databases
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
Reynold Cheng, Eric Lo, Xuan Yang, Ming-Hay Luk, X...
PVLDB
2010
122views more  PVLDB 2010»
13 years 7 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
PVLDB
2010
191views more  PVLDB 2010»
13 years 7 months ago
SnipSuggest: Context-Aware Autocompletion for SQL
In this paper, we present SnipSuggest, a system that provides onthe-go, context-aware assistance in the SQL composition process. SnipSuggest aims to help the increasing population...
Nodira Khoussainova, YongChul Kwon, Magdalena Bala...
PVM
2010
Springer
13 years 7 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
RSA
2010
94views more  RSA 2010»
13 years 7 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
« Prev « First page 3625 / 3691 Last » Next »