Sciweavers

112 search results - page 13 / 23
» Faster deterministic dictionaries
Sort
View
WAE
2001
227views Algorithms» more  WAE 2001»
13 years 8 months ago
Compact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
Gonzalo Navarro, Mathieu Raffinot
ICML
2006
IEEE
14 years 8 months ago
Clustering documents with an exponential-family approximation of the Dirichlet compound multinomial distribution
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
Charles Elkan
INFOCOM
2002
IEEE
14 years 13 days ago
Probabilistic Location and Routing
Abstract—We propose probabilistic location to enhance the performance of existing peer-to-peer location mechanisms in the case where a replica for the queried data item exists cl...
Sean C. Rhea, John Kubiatowicz
IPPS
1998
IEEE
13 years 11 months ago
Multiprocessor Scheduling Using Mean-Field Annealing
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
Shaharuddin Salleh, Albert Y. Zomaya
COMPGEOM
1998
ACM
13 years 11 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan