Sciweavers

282 search results - page 34 / 57
» Generating non-redundant association rules
Sort
View
BIRTHDAY
2003
Springer
15 years 2 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg
FLAIRS
2007
14 years 12 months ago
Mining Sequences in Distributed Sensors Data for Energy Production
The desire to predict power generation at a given point in time is essential to power scheduling, energy trading, and availability modeling. The research conducted within is conce...
Mehmed M. Kantardzic, John Gant
107
Voted
CCS
2005
ACM
15 years 3 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
BMCBI
2010
149views more  BMCBI 2010»
14 years 9 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
CORR
2010
Springer
132views Education» more  CORR 2010»
14 years 9 months ago
ETP-Mine: An Efficient Method for Mining Transitional Patterns
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
B. Kiran Kumar