Sciweavers

4328 search results - page 306 / 866
» A New Kind of Science
Sort
View
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
15 years 1 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
CSDA
2011
15 years 1 months ago
An affine invariant multiple test procedure for assessing multivariate normality
: A multiple test procedure for assessing multivariate normality (MVN) that combines a finite set of affine invariant test statistics for MVN is proposed. This combination is base...
Carlos Tenreiro
TCS
2011
15 years 1 months ago
Sorting and selection on dynamic data
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
TCS
2010
15 years 1 months ago
Monad transformers as monoid transformers
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...
Mauro Jaskelioff, Eugenio Moggi
357
Voted
ALENEX
2011
416views Algorithms» more  ALENEX 2011»
14 years 10 months ago
Exact Pattern Matching with Feed-Forward Bloom Filters
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
Iulian Moraru, David G. Andersen