Sciweavers

5539 search results - page 54 / 1108
» What can be computed locally
Sort
View
PAM
2009
Springer
14 years 4 months ago
Access Point Localization Using Local Signal Strength Gradient
Abstract. Many previous studies have examined the placement of access points (APs) to improve the community’s understanding of the deployment and behavioral characteristics of wi...
Dongsu Han, David G. Andersen, Michael Kaminsky, K...
ADHOCNOW
2008
Springer
14 years 4 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
IPPS
1994
IEEE
14 years 2 months ago
Building Multithreaded Architectures with Off-the-Shelf Microprocessors
Present-day parallel computers often face the problems of large software Overheadsfor process switching and interprocessor communication. These problems are addressed by the Multi...
Herbert H. J. Hum, Kevin B. Theobald, Guang R. Gao
CEEMAS
2005
Springer
13 years 12 months ago
Palpable Computing and the Role of Agent Technology
This paper presents a computing approach, called Palpable Computing, complementing and extending Ambient Computing notions and techniques. The main contribution of this paper lies ...
Giovanni Rimassa, Dominic A. P. Greenwood, Monique...
ACMSE
2007
ACM
14 years 1 months ago
Verifying design modularity, hierarchy, and interaction locality using data clustering techniques
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...
Liguo Yu, Srini Ramaswamy