Sciweavers

57 search results - page 6 / 12
» What Does the Future Hold for Theoretical Computer Science
Sort
View
ICS
2004
Tsinghua U.
14 years 26 days ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian
CSE
2009
IEEE
14 years 2 months ago
Tuning Evidence-Based Trust Models
Abstract—Many evidence-based trust models require the adjustment of parameters such as aging- or exploration-factors. What the literature often does not address is the systematic...
Eugen Staab, Thomas Engel
FOCS
1993
IEEE
13 years 11 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
STACS
1992
Springer
13 years 11 months ago
Graph Isomorphism is Low for PP
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
Johannes Köbler, Uwe Schöning, Jacobo To...
CSE
2009
IEEE
14 years 2 months ago
Privacy in Online Social Networking at Workplace
—Employees using social network sites (SNS) at workplace is a fact. As companies are further embracing social media, how if at all does this practice affect the work dynamics? Wh...
Yang Wang 0005, Alfred Kobsa