5221 search results - page 831 / 1045 » An On-line Problem Database |
238
click to vote
SIGMOD
2008
ACM
16 years 6 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 ...
354
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
238
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Schema mappings are logical assertions that specify the relationships between a source and a target schema in a declarative way. The specification of such mappings is a fundamenta...
247
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...
264
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Sensor networks are widely used in many applications for collecting information from the physical environment. In these applications, it is usually necessary to track the relation...