147 search results - page 9 / 30 » Logarithmic keying |
SODA
2012
ACM
12 years 7 days ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
ORL
2008
13 years 9 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
JSC
2011
13 years 4 months ago
2011
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...