Sciweavers

2467 search results - page 343 / 494
» Finite State Machines
Sort
View
120
Voted
DATAMINE
1998
249views more  DATAMINE 1998»
15 years 15 days ago
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Decision trees have proved to be valuable tools for the description, classi cation and generalizationof data. Work on constructingdecisiontrees from data exists in multiplediscipli...
Sreerama K. Murthy
87
Voted
ICWE
2010
Springer
14 years 11 months ago
Models and Meta Models for Transactions in Web Applications
In this paper, we present a DSL to specify business and web transactions in a systematic way, addressing both informational and behavioral perspectives. Our meta-model is based on ...
Mark Douglas Jacyntho, Daniel Schwabe
ENTCS
2010
122views more  ENTCS 2010»
14 years 10 months ago
Efficient Earley Parsing with Regular Right-hand Sides
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...
Trevor Jim, Yitzhak Mandelbaum
123
Voted
SOSP
2007
ACM
15 years 9 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 7 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner