123 search results - page 24 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
ICDE
2006
IEEE
14 years 7 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
FCT
1997
Springer
13 years 9 months ago
1997
Springer
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
MOBIHOC
2006
ACM
14 years 5 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...
HM
2007
Springer
13 years 11 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...