Sciweavers

1333 search results - page 36 / 267
» Not a Number of Floating Point Problems
Sort
View
138
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
Adding Capacity Points to a Wireless Mesh Network Using Local Search
Abstract— Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user populations. As the network usage grows, network...
Joshua Robinson, Mustafa Uysal, Ram Swaminathan, E...
CCCG
2010
15 years 4 months ago
On polygons excluding point sets
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
Radoslav Fulek, Balázs Keszegh, Filip Moric...
158
Voted
TON
2012
13 years 5 months ago
Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
Yi Shi, Y. Thomas Hou
147
Voted
PAAPP
1998
149views more  PAAPP 1998»
15 years 3 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
137
Voted
ICPADS
2007
IEEE
15 years 9 months ago
Access point selection algorithms for maximizing throughputs in wireless LAN environment
In wireless LAN technology, access point selection at each station is a critical problem in order to obtain satisfactory throughputs. The current protocol for access point selecti...
Akihiro Fujiwara, Yasuhiro Sagara, Masahiko Nakamu...