Sciweavers

2738 search results - page 48 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
VTC
2010
IEEE
147views Communications» more  VTC 2010»
13 years 6 months ago
Generalized Proportionally Fair Scheduling for Multi-User Amplify-and-Forward Relay Networks
—Providing ubiquitous very high data rate coverage in next generation wireless networks is a formidable goal, requiring cost-effective radio access network (RAN) devices, such as...
Alireza Sharifian, Petar Djukic, Halim Yanikomerog...
ICCV
2003
IEEE
14 years 9 months ago
An affine invariant deformable shape representation for general curves
Automatic construction of Shape Models from examples has been the focus of intense research during the last couple of years. These methods have proved to be useful for shape segme...
Anders Ericsson, Kalle Åström
ASIACRYPT
2003
Springer
14 years 28 days ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...
SIGMETRICS
2002
ACM
103views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Network tomography on general topologies
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...
Tian Bu, Nick G. Duffield, Francesco Lo Presti, Do...
FOSSACS
2007
Springer
13 years 11 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...