Sciweavers

360 search results - page 11 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
INFOSCALE
2009
ACM
15 years 2 months ago
CAWA: Continuous Approximate Where-About Queries
With the current proliferation of wireless networks and mobile device technologies, the management of moving object databases to facilitate queries over these domains has been exte...
Alexander J. Aved, Kien A. Hua, Antoniya Petkova
116
Voted
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 5 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
IPPS
2005
IEEE
15 years 3 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
89
Voted
GRID
2003
Springer
15 years 2 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
58
Voted
KIVS
2005
Springer
15 years 3 months ago
Caching for Improved Retrieval in Peer-to-Peer Networks
: In modern information systems the dominant retrieval paradigms have shifted from exact matching towards retrieving a list of the most relevant objects. This is because users usua...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...