Sciweavers

2485 search results - page 175 / 497
» Time Bounded Frequency Computations
Sort
View
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
16 years 1 days ago
Pebbling and Proofs of Work
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
Cynthia Dwork, Moni Naor, Hoeteck Wee
FCT
2003
Springer
15 years 11 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
CPHYSICS
2007
96views more  CPHYSICS 2007»
15 years 6 months ago
Simple models for biomembrane structure and dynamics
Simulation of biomembranes over length and time scales relevant to cellular biology is not currently feasible with molecular dynamics including full atomic detail. Barring an unfo...
Frank L. H. Brown
DAC
2010
ACM
15 years 10 months ago
Automated compact dynamical modeling: an enabling tool for analog designers
In this paper we summarize recent developments in compact dynamical modeling for both linear and nonlinear systems arising in analog applications. These techniques include methods...
Bradley N. Bond, Luca Daniel
ISSS
2002
IEEE
124views Hardware» more  ISSS 2002»
15 years 11 months ago
Timing Analysis of Embedded Software for Speculative Processors
Static timing analysis of embedded software is important for systems with hard real-time constraints. To accurately estimate time bounds, it is essential to model the underlying m...
Abhik Roychoudhury, Xianfeng Li, Tulika Mitra