Sciweavers

1302 search results - page 241 / 261
» Fair Equivalence Relations
Sort
View
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
14 years 2 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
DEXA
2009
Springer
166views Database» more  DEXA 2009»
14 years 2 months ago
Tags4Tags: Using Tagging to Consolidate Tags
Tagging has become increasingly popular and useful across various social networks and applications. It allows users to classify and organize resources for improving the retrieval p...
Leyla Jael García-Castro, Martin Hepp, Alex...
RTAS
2008
IEEE
14 years 2 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
GLOBECOM
2007
IEEE
14 years 2 months ago
Beamforming with Limited Feedback in Amplify-and-Forward Cooperative Networks
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
Yi Zhao, Raviraj Adve, Teng Joon Lim
FOCS
2006
IEEE
14 years 1 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor