Sciweavers

810 search results - page 69 / 162
» Continuous cartogram construction
Sort
View
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
13 years 11 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
Eli Ben-Sasson, Michael Viderman
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
13 years 10 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 9 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 9 months ago
Improved Squeaky Wheel Optimisation for Driver Scheduling
Abstract. This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation'...
Uwe Aickelin, Edmund K. Burke, Jingpeng Li
MOBIHOC
2008
ACM
14 years 8 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...