20745 search results - page 3891 / 4149 » Computer graphics for all |
196
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
201
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
244
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
229
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
223
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...