Sciweavers

729 search results - page 59 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
IPCO
2004
144views Optimization» more  IPCO 2004»
15 years 7 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
ENDM
2010
136views more  ENDM 2010»
15 years 6 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
IJISEC
2006
108views more  IJISEC 2006»
15 years 6 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
JSW
2008
122views more  JSW 2008»
15 years 6 months ago
Security Analysis on a Family of Ultra-lightweight RFID Authentication Protocols
Abstract-- In this paper, we analyze the security vulnerabilities of a family of ultra-lightweight RFID mutual authentication protocols: LMAP [13], M2 AP [14] and EMAP [15], which ...
Tieyan Li, Guilin Wang, Robert H. Deng
SIGPRO
2002
80views more  SIGPRO 2002»
15 years 5 months ago
Design of optimum high-order finite-wordlength digital FIR filters with linear phase
Abstract-A novel iterative quantization procedure for the design of finite wordlength linear phase FIR filters of high order and minimum frequency domain error is proposed: a one b...
Gennaro Evangelista