1022 search results - page 72 / 205 » Efficient Query Processing in Large Traffic Networks |
232
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
145
Voted
ITCC
2005
IEEE
15 years 9 months ago
2005
IEEE
has to be relayed to nodes interested in those events. Moreover, nodes may also generate queries to find events they are interested in. Thus there is a need to route the informatio...
149
click to vote
ICCD
2008
IEEE
16 years 1 months ago
2008
IEEE
— The aggregate power consumption of the Internet is increasing at an alarming rate, due in part to the rapid increase in the number of connected edge devices such as desktop PCs...
159
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
162
click to vote
DEBS
2009
ACM
15 years 8 months ago
2009
ACM
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...