Sciweavers

1529 search results - page 54 / 306
» A slant removal algorithm
Sort
View
EWCBR
2004
Springer
14 years 4 months ago
An Analysis of Case-Base Editing in a Spam Filtering System
Because of the volume of spam email and its evolving nature, any deployed Machine Learning-based spam filtering system will need to have procedures for case-base maintenance. Key t...
Sarah Jane Delany, Padraig Cunningham
POPL
1999
ACM
14 years 3 months ago
Constraint Systems for Useless Variable Elimination
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational o...
Mitchell Wand, Igor Siveroni
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
12 years 1 months ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler
FMCAD
2006
Springer
14 years 2 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina
WWW
2008
ACM
14 years 11 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen