Sciweavers

8437 search results - page 162 / 1688
» Preferences over Sets
Sort
View
FLAIRS
2001
15 years 7 months ago
Tracking Clusters in Evolving Data Sets
As organizations accumulate data over time, the problem of tracking how patterns evolve becomes important. In this paper, we present an algorithm to track the evolution of cluster...
Daniel Barbará, Ping Chen
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 6 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price
IJAR
2008
129views more  IJAR 2008»
15 years 6 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
KELSI
2004
Springer
15 years 11 months ago
Improving Rule Induction Precision for Automated Annotation by Balancing Skewed Data Sets
There is an overwhelming increase in submissions to genomic databases, posing a problem for database maintenance, especially regarding annotation of fields left blank during submi...
Gustavo E. A. P. A. Batista, Maria Carolina Monard...
LPAR
2007
Springer
16 years 16 days ago
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
Abstract. The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible ...
Michel Ludwig, Uwe Waldmann