Sciweavers

1199 search results - page 185 / 240
» Parameterized Proof Complexity
Sort
View
IJCM
2010
80views more  IJCM 2010»
13 years 7 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
INFOCOM
2010
IEEE
13 years 7 months ago
CapAuth: A Capability-based Handover Scheme
—Existing handover schemes in wireless LANs, 3G/4G networks, and femtocells rely upon protocols involving centralized authentication servers and one or more access points. These ...
Liang Cai, Sridhar Machiraju, Hao Chen
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 6 months ago
Analysis Of Cancer Omics Data In A Semantic Web Framework
Our work concerns the elucidation of the cancer (epi)genome, transcriptome and proteome to better understand the complex interplay between a cancer cell's molecular state and ...
Matthew Holford, James P. McCusker, Kei-Hoi Cheung...
CAV
2012
Springer
265views Hardware» more  CAV 2012»
11 years 11 months ago
An Axiomatic Memory Model for POWER Multiprocessors
The growing complexity of hardware optimizations employed by multiprocessors leads to subtle distinctions among allowed and disallowed behaviors, posing challenges in specifying th...
Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Kayv...
ACSC
2008
IEEE
14 years 3 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen