Sciweavers

Share
ASUNAM
2011
IEEE
7 years 10 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
CORR
2011
Springer
209views Education» more  CORR 2011»
8 years 2 months ago
I Don't Want to Think About it Now:Decision Theory With Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern, Rafael Pass
APAL
2006
94views more  APAL 2006»
8 years 10 months ago
Parameterized counting problems
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
Catherine McCartin
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
9 years 2 months ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
Tatsuaki Okamoto, David Pointcheval
KR
2010
Springer
9 years 3 months ago
I Don't Want to Think About it Now: Decision Theory with Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern
ICALP
2003
Springer
9 years 3 months ago
Problems on RNA Secondary Structure Prediction and Design
We describe several computational problems on prediction and design of RNA molecules.
Anne Condon
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
9 years 3 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
books