Sciweavers

792 search results - page 127 / 159
» Constrained Ramsey Numbers
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Toward resilient security in wireless sensor networks
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William A....
CEC
2009
IEEE
14 years 2 months ago
Task decomposition and evolvability in intrinsic evolvable hardware
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
Tüze Kuyucu, Martin Trefzer, Julian Francis M...
ASIACRYPT
2007
Springer
14 years 1 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
IROS
2006
IEEE
162views Robotics» more  IROS 2006»
14 years 1 months ago
Efficiency Improvement in Monte Carlo Localization through Topological Information
- Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Many studies have been conducted to improve performance of MCL. Al...
Tae-Bum Kwon, Ju-Ho Yang, Jae-Bok Song, Woojin Chu...
PODC
2006
ACM
14 years 1 months ago
Adversarial queuing on the multiple-access channel
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A....