Sciweavers

1399 search results - page 71 / 280
» Multi-party Finite Computations
Sort
View
ANCS
2009
ACM
13 years 7 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
14 years 1 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
14 years 4 hour ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona
ACL
2001
13 years 11 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
AMC
2010
86views more  AMC 2010»
13 years 10 months ago
BVMs for computing Sturm-Liouville symmetric potentials
The paper deals with the numerical solution of inverse Sturm-Liouville problems with unknown potential symmetric over the interval [0, ]. The proposed method is based on the use o...
Paolo Ghelardoni, Cecilia Magherini