390 search results - page 60 / 78 » Approximate Query Answering in Locally Closed Databases |
ICDE
2010
IEEE
15 years 2 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
136
click to vote
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
DBPL
1999
Springer
15 years 2 months ago
1999
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
SENSYS
2004
ACM
15 years 3 months ago
2004
ACM
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...