Sciweavers

2723 search results - page 23 / 545
» Learning lexicographic orders
Sort
View
AAAI
1990
13 years 8 months ago
Solving Term Inequalities
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...
Gerald E. Peterson
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
JMIV
2000
86views more  JMIV 2000»
13 years 7 months ago
Vector Median Filters, Inf-Sup Operations, and Coupled PDE's: Theoretical Connections
In this paper, we formally connect between vector median filters, inf-sup morphological operations, and geometric partial differential equations. Considering a lexicographic order,...
Vicent Caselles, Guillermo Sapiro, Do Hyun Chung
FUIN
2002
76views more  FUIN 2002»
13 years 7 months ago
Making revision reversible: an approach based on polynomials
This paper deals with iterated belief change and proposes a drastic revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the in...
Salem Benferhat, Didier Dubois, Sylvain Lagrue, Od...
ICTAI
2010
IEEE
13 years 5 months ago
Comparing Approaches to Preference Dominance for Conversational Recommenders
A conversational recommender system iteratively shows a small set of options for its user to choose between. In order to select these options, the system may analyze the queries tr...
Walid Trabelsi, Nic Wilson, Derek G. Bridge, Franc...