1510 search results - page 199 / 302 » Upper Probabilities and Additivity |
132
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
233
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
146
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
152
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
128
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...