3276 search results - page 555 / 656 » Data Management for Pervasive Computing |
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
SIGSOFT
2003
ACM
14 years 11 months ago
2003
ACM
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
EDBT
2010
ACM
14 years 5 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
LCN
2007
IEEE
14 years 4 months ago
2007
IEEE
—Multicasting has not been widely adopted until now, due to lack of access control over the group members. The Authentication, Authorization and Accounting (AAA) protocols are be...