Sciweavers

347 search results - page 50 / 70
» On private computation in incomplete networks
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
OPODIS
2010
13 years 5 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 15 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
NDSS
2002
IEEE
14 years 18 days ago
Advanced Client/Server Authentication in TLS
Many business transactions on the Internet occur between strangers, that is, between entities with no prior relationship and no common security domain. Traditional security approa...
Adam Hess, Jared Jacobson, Hyrum Mills, Ryan Wamsl...
HUC
2009
Springer
14 years 8 days ago
A Long-Duration Study of User-Trained 802.11 Localization
We present an indoor wireless localization system that is capable of room-level localization based solely on 802.11 network signal strengths and usersupplied training data. Our sys...
Andrew Barry, Benjamin Fisher, Mark L. Chang