Sciweavers

350 search results - page 66 / 70
» Hardness Results for Homology Localization
Sort
View
SENSYS
2003
ACM
14 years 18 days ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
SAC
2009
ACM
14 years 14 hour ago
Self-organized control of knowledge generation in pervasive computing systems
Pervasive computing devices (e.g., sensor networks, localization devices, cameras, etc.) are increasingly present in every aspect of our lives. These devices are able to generate ...
Gabriella Castelli, Ronaldo Menezes, Franco Zambon...
ANCS
2007
ACM
13 years 11 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
13 years 11 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
CCS
2006
ACM
13 years 11 months ago
Hot or not: revealing hidden services by their clock skew
Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden service...
Steven J. Murdoch