Sciweavers

1347 search results - page 14 / 270
» On the Structure of the Minimum Time Function
Sort
View
ACNS
2006
Springer
117views Cryptology» more  ACNS 2006»
14 years 1 months ago
Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?
We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents befo...
Ahto Buldas, Sven Laur
DOCENG
2006
ACM
14 years 1 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
TNN
2011
129views more  TNN 2011»
13 years 2 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
HASKELL
2009
ACM
14 years 2 months ago
Lazy functional incremental parsing
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
Jean-Philippe Bernardy
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson