Sciweavers

3359 search results - page 461 / 672
» A Simplified Idea Algorithm
Sort
View
FOCS
1999
IEEE
14 years 3 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
TIME
1999
IEEE
14 years 3 months ago
TALplanner: An Empirical Investigation of a Temporal Logic-Based Forward Chaining Planner
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
Patrick Doherty, Jonas Kvarnström
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
14 years 3 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
KDD
1998
ACM
170views Data Mining» more  KDD 1998»
14 years 3 months ago
Mining Audit Data to Build Intrusion Detection Models
In this paper we discuss a data mining framework for constructing intrusion detection models. The key ideas are to mine system audit data for consistent and useful patterns of pro...
Wenke Lee, Salvatore J. Stolfo, Kui W. Mok
VLDB
1998
ACM
142views Database» more  VLDB 1998»
14 years 3 months ago
On the Discovery of Interesting Patterns in Association Rules
Many decision support systems, which utilize association rules for discovering interesting patterns, require the discovery of association rules that vary over time. Such rules des...
Sridhar Ramaswamy, Sameer Mahajan, Abraham Silbers...