Sciweavers

1243 search results - page 57 / 249
» On the locality of bounded growth
Sort
View
CLUSTER
2008
IEEE
14 years 2 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman
MFCS
2009
Springer
14 years 8 days ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
CGF
2008
103views more  CGF 2008»
13 years 7 months ago
An Example-based Procedural System for Element Arrangement
We present a method for synthesizing two dimensional (2D) element arrangements from an example. The main idea is to combine texture synthesis techniques based-on a local neighborh...
Takashi Ijiri, Radomír Mech, Takeo Igarashi...
WMCSA
2012
IEEE
12 years 3 months ago
SpinLoc: spin once to know your location
The rapid growth of location-based applications has spurred extensive research on localization. Nonetheless, indoor localization remains an elusive problem mostly because the accu...
Souvik Sen, Romit Roy Choudhury, Srihari Nelakudit...
MOBIHOC
2009
ACM
14 years 8 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant