Sciweavers

2924 search results - page 240 / 585
» Lower Bounds in Distributed Computing
Sort
View
AMC
2007
102views more  AMC 2007»
15 years 3 months ago
Existence and computation of short-run equilibria in economic geography
The new economic geography literature provides a general equilibrium framework that explains the emergence of economic agglomerations as a trade-off between increasing returns at...
Nicos G. Pavlidis, Michael N. Vrahatis, P. Mossay
165
Voted
PERCOM
2004
ACM
16 years 3 months ago
Towards Scalable P2P Computing for Mobile Ad Hoc Networks
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...
Marco Conti, Enrico Gregori, Giovanni Turi
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 11 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
150
Voted
ISLPED
1996
ACM
110views Hardware» more  ISLPED 1996»
15 years 8 months ago
Statistical estimation of average power dissipation in CMOS VLSI circuits using nonparametric techniques
In this paper, we present a new statistical technique for estimation of average power dissipation in digital circuits. Present statistical techniques estimate the average power ba...
Li-Pen Yuan, Chin-Chi Teng, Sung-Mo Kang
98
Voted
SENSYS
2009
ACM
15 years 10 months ago
A wake-on sensor network
: This paper present a wake-on sensor network formed with the wake-on motes, TelosW. Our wake-on hardware and software design enable lower power operations and longer network lifet...
Gang Lu, Debraj De, Mingsen Xu, Wen-Zhan Song, Beh...