Sciweavers

3208 search results - page 254 / 642
» A Lower Bound for Primality
Sort
View
INFOCOM
2012
IEEE
13 years 9 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
ICCAD
2006
IEEE
129views Hardware» more  ICCAD 2006»
16 years 3 months ago
Energy budgeting for battery-powered sensors with a known task schedule
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
Daler N. Rakhmatov
ICC
2007
IEEE
16 years 29 days ago
ORC-GPS: Output Rate-Controlled Scheduling Policy for Delay Guarantees
Abstract—Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2 Q) and Self-Clocked Fair Queueing (SCFQ) have been propo...
Masaki Hanada, Hidenori Nakazato
LICS
1995
IEEE
15 years 10 months ago
Tree Canonization and Transitive Closure
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
Kousha Etessami, Neil Immerman
CCCG
2009
15 years 7 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
Shiliang Cui, Iyad A. Kanj, Ge Xia