Sciweavers

507 search results - page 86 / 102
» Sizes of Ordered Decision Trees
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 7 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
SAC
2009
ACM
14 years 2 months ago
Optimal service level allocation in environmentally powered embedded systems
Energy management is a critical concern in the design of embedded systems to prolong the lifetime or to maximize the performance under energy constraints. In particular, the emerg...
Clemens Moser, Jian-Jia Chen, Lothar Thiele
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
14 years 2 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
DASC
2006
IEEE
14 years 1 months ago
On Recognizing Virtual Honeypots and Countermeasures
— Honeypots are decoys designed to trap, delay, and gather information about attackers. We can use honeypot logs to analyze attackers’ behaviors and design new defenses. A virt...
Xinwen Fu, Wei Yu, Dan Cheng, Xuejun Tan, Kevin St...