497 search results - page 73 / 100 » Spies among us |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
PODS
2002
ACM
14 years 7 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...