Sciweavers

2127 search results - page 419 / 426
» Computing large matchings fast
Sort
View
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 8 months ago
Navigation- vs. Index-Based XML Multi-Query Processing
XML path queries form the basis of complex filtering of XML data. Most current XML path query processing techniques can be divided in two groups. Navigation-based algorithms compu...
Nicolas Bruno, Luis Gravano, Nick Koudas, Divesh S...
GIS
2008
ACM
14 years 8 months ago
Mining user similarity based on location history
The pervasiveness of location-acquisition technologies (GPS, GSM networks, etc.) enable people to conveniently log the location histories they visited with spatio-temporal data. T...
Quannan Li, Yu Zheng, Xing Xie, Yukun Chen, Wenyu ...
GIS
2009
ACM
14 years 8 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah
WWW
2005
ACM
14 years 8 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
ICALP
2009
Springer
14 years 7 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald