Sciweavers

148 search results - page 13 / 30
» On Perfect Completeness for QMA
Sort
View
WG
2004
Springer
14 years 29 days ago
Recognizing HHD-free and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
Stavros D. Nikolopoulos, Leonidas Palios
SEC
2008
13 years 9 months ago
Hiding in Groups: On the Expressiveness of Privacy Distributions
Many applications inherently disclose information because perfect privacy protection is prohibitively expensive. RFID tags, for example, cannot be equipped with the cryptographic p...
Karsten Nohl, David Evans
SEMWEB
2007
Springer
14 years 1 months ago
Potluck: Semi-Ontology Alignment for Casual Users
Potluck is a web user interface (Figure 1) that lets casual users— those without programming skills and data modeling expertise—merge and repurpose heterogeneous Semantic Web d...
David F. Huynh, Robert C. Miller, David R. Karger
GLOBECOM
2006
IEEE
14 years 1 months ago
Adaptive Coding and Modulation for Hybrid ARQ Systems over Partially Observable Nakagami-m Fading Channels
— We study coding and modulation rate adaptation problem for HARQ systems with partially observable state from cross-layer viewpoint. The rate of convolutionally coded MQAM is ad...
Ashok K. Karmokar, Vijay K. Bhargava
ICRA
2006
IEEE
144views Robotics» more  ICRA 2006»
14 years 1 months ago
Adapting Probabilistic Roadmaps to Handle Uncertain Maps
Abstract— Randomized motion planning techniques are responsible for many of the recent successes in robot control. However, most motion planning algorithms assume perfect and com...
Patrycja E. Missiuro, Nicholas Roy