Sciweavers

692 search results - page 103 / 139
» Combinatorics of Partial Derivatives
Sort
View
TC
2008
14 years 9 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
TCS
2008
14 years 9 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...
TCS
2008
14 years 9 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
TIP
2008
168views more  TIP 2008»
14 years 9 months ago
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
Yonggang Shi, William Clement Karl
JC
2007
94views more  JC 2007»
14 years 9 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou