Sciweavers

2745 search results - page 549 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
PVLDB
2008
107views more  PVLDB 2008»
13 years 4 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
MMAS
2011
Springer
13 years 6 days ago
Scalable Bayesian Reduced-Order Models for Simulating High-Dimensional Multiscale Dynamical Systems
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...
Phaedon-Stelios Koutsourelakis, Elias Bilionis
TIT
2010
130views Education» more  TIT 2010»
12 years 12 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar
CBSE
2011
Springer
12 years 5 months ago
Towards incremental component compatibility testing
Software components are increasingly assembled from other components. Each component may further depend on others, and each may have multiple active versions. The total number of ...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....
PODC
2004
ACM
13 years 10 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen