Sciweavers

356 search results - page 16 / 72
» Pairwise Cardinality Networks
Sort
View
IANDC
2008
84views more  IANDC 2008»
13 years 6 months ago
Authenticating ad hoc networks by comparison of short digests
We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...
L. H. Nguyen, A. W. Roscoe
TELETRAFFIC
2007
Springer
14 years 1 months ago
Network Capacity Allocation in Service Overlay Networks
We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning pro...
Ngok Lam, Zbigniew Dziong, Lorne Mason
INFOCOM
2005
IEEE
14 years 1 months ago
Mobile-assisted localization in wireless sensor networks
Abstract— The localization problem is to determine an assignment of coordinates to nodes in a wireless ad-hoc or sensor network that is consistent with measured pairwise node dis...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...
NIPS
2008
13 years 9 months ago
Mixed Membership Stochastic Blockmodels
Consider data consisting of pairwise measurements, such as presence or absence of links between pairs of objects. These data arise, for instance, in the analysis of protein intera...
Edoardo Airoldi, David M. Blei, Stephen E. Fienber...
HICSS
2009
IEEE
85views Biometrics» more  HICSS 2009»
14 years 2 months ago
Bounding the Size of k-Tuple Covers
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...
Wolfgang W. Bein, Shahram Latifi, Linda Morales, I...