Sciweavers

2766 search results - page 539 / 554
» Algorithms for trigonometric polynomials
Sort
View
QEST
2008
IEEE
14 years 2 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 2 months ago
Apply Model Checking to Security Analysis in Trust Management
Trust management is a form of access control that uses delegation to achieve scalability beyond a single organization or federation. However, delegation can be difficult to contr...
Mark Reith, Jianwei Niu, William H. Winsborough
ICEBE
2007
IEEE
126views Business» more  ICEBE 2007»
14 years 2 months ago
Consumer-Centric Web Services Discovery and Subscription
Nowadays, there are a number of similar web services over the internet or intranet. They provide consumers with more choices according to their personalized QoS requirements. Howe...
Xuanzhe Liu, Li Zhou, Gang Huang, Hong Mei
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
Optimal Relay Node Fault Recovery
—Topology control problems are concerned with the assignment of power levels to the nodes of an ad-hoc network so as to maintain a specified network topology while minimizing th...
Fei Che, Liang Zhao, Errol L. Lloyd
ASIACRYPT
2007
Springer
14 years 2 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é...