2070 search results - page 131 / 414 » Querying Communities in Relational Databases |
PAMI
2010
14 years 9 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
158
click to vote
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
straction for Information Management Michael Franklin University of California, Berkeley Alon Halevy Google Inc. and U. Washington David Maier Portland State University The develo...
SIGMOD
2002
ACM
15 years 11 months ago
2002
ACM
The emergence of the Web has increased interests in XML data. XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured data. Without a s...
106
click to vote
DASFAA
2011
IEEE
14 years 2 months ago
2011
IEEE
In this paper, we propose a method to search the Web for sentence substitutions for a given sentence query. Our method uses only lexico-syntactic patterns dynamically generated fro...
158
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...