2635 search results - page 441 / 527 » Algorithms for the Database Layout Problem |
120
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
157
click to vote
AICCSA
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a systematic approach to mine colocation patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of s...
157
click to vote
AH
2008
Springer
15 years 10 months ago
2008
Springer
The information explosion in today’s electronic world has created the need for information filtering techniques that help users filter out extraneous content to identify the righ...
138
Voted
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
139
Voted
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...