789 search results - page 109 / 158 » On Theory Revision with Queries |
99
Voted
CORR
2006
Springer
15 years 23 days ago
2006
Springer
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
105
Voted
TKDE
2010
14 years 11 months ago
2010
Abstract—The imperfect nature of context in Ambient Intelligence environments and the special characteristics of the entities that possess and share the available context informa...
105
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
102
Voted
PODS
2006
ACM
16 years 26 days ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
109
Voted
WSDM
2010
ACM
15 years 10 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...