Sciweavers

2583 search results - page 516 / 517
» Compiling for stream processing
Sort
View
ANCS
2009
ACM
13 years 5 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...
IJBIS
2010
82views more  IJBIS 2010»
13 years 4 months ago
Simulation discounted cash flow valuation for internet companies
Discounted cash flow (DCF) is the most accepted approach for company valuation. It is well grounded in theory and practice. However, the DCF approach, which is commonly used for t...
Maged Ali, Ramzi El-Haddadeh, Tillal Eldabi, Ebrah...
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 2 months ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
ICLP
2011
Springer
12 years 11 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer
SPAA
2012
ACM
11 years 9 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...