Sciweavers

922 search results - page 166 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
JCS
2010
112views more  JCS 2010»
13 years 6 months ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
PPSN
2010
Springer
13 years 6 months ago
Towards Analyzing Recombination Operators in Evolutionary Search
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
Yang Yu, Chao Qian, Zhi-Hua Zhou
CCS
2010
ACM
13 years 5 months ago
Adjustable autonomy for cross-domain entitlement decisions
Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially...
Jacob Beal, Jonathan Webb, Michael Atighetchi
STACS
2010
Springer
14 years 2 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 2 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman