Sciweavers

2419 search results - page 314 / 484
» Precise Distributed Localization Algorithms for Wireless Net...
Sort
View
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 6 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
PERCOM
2003
ACM
16 years 4 months ago
System Design of Smart Table
This paper describes the system design of Smart Table, a table that can track and identify multiple objects simultaneously when placed on top of its surface. The table has been de...
Philipp Steurer, Mani B. Srivastava
CISS
2008
IEEE
15 years 10 months ago
Relay selection methods for wireless cooperative communications
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
Seunghoon Nam, Mai Vu, Vahid Tarokh
AINA
2006
IEEE
15 years 10 months ago
SENS: A Scalable and Expressive Naming System using CAN Routing Algorithm
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
Hoaison Nguyen, Toshio Oka, Hiroyuki Morikawa, Tom...
MOBIHOC
2006
ACM
16 years 4 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt